Everything about Cantor–Zassenhaus algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Cantor–Zassenhaus algorithmA 5-minute orientation
2. Pick up a classic book: Algorithmic Algebraic Number TheoryThe most-reprinted book on the subject
3. Read the landmark paper: A Verified Implementation of the Berlekamp–Zassenhaus Factorization AlgorithmCited 3 times
4. Go sideways: Berlekamp's algorithmA closely related topic
5. Go sideways: Factorization of polynomials over finite fieldsA closely related topic

🏆 Landmark papers (most cited)

• A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm

  Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann · 2019 · Journal of Automated Reasoning · 3 citations

• An algorithm to construct candidates to counterexamples to the Zassenhaus Conjecture

  Leo Margolis, Ángel del Río · 2018 · Journal of Algebra · 2 citations

• A generalisation of the Cantor-Zassenhaus algorithm

  C. Hidber · 1997 · Computing · 0 citations

• Improvements on the Cantor-Zassenhaus factorization algorithm

  Michele Elia, Davide Schipani · 2015 · Mathematica Bohemica · 0 citations

📚 Books worth reading

• Algorithmic Algebraic Number TheoryM. Pohst, H. Zassenhaus · 1997
• Algorithmic algebraic number theoryM. Pohst · 1989
• Algorithmic methods in algebra and number theoryM. Pohst

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Berlekamp's algorithm In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known…
• Factorization of polynomials over finite fields In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition…
• Factorization of polynomials In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field…
• XTR In cryptography, XTR is an algorithm for public-key encryption. XTR stands for 'ECSTR', which is an abbreviation for Efficient and Compact Subgroup Trace…
• Polynomial greatest common divisor In algebra, the greatest common divisor (frequently abbreviated GCD or gcd) of two polynomials is a polynomial, of the highest possible degree, which is…
• Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
• Hidden subgroup problem The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including…
• Function field sieve In mathematics, the Function Field Sieve is one of the most efficient algorithms to solve the Discrete Logarithm Problem (DLP) in a finite field. It has…