Factoring Polynomials Over Finite Fields: A Survey

2001/01/01 by Joachim von zur Gathen, Daniel Panario · 2 citations
Computer Science · #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic

paper · doi:10.1006/jsco.1999.1002

crossref issued 2001/01/01 · crossref published 2001/01/01 · crossref published-print 2001/01/01 · openalex publication_date 2001/01/01 · crossref created 2002/09/18 · crossref deposited 2024/12/02 · openalex created_date 2025/10/10 · crossref indexed 2026/04/22 · openalex updated_date 2026/07/23

Citations

• Computational Complexity of Probabilistic Turing Machines
• Factoring polynomials with rational coefficients

Cited by

• Security of the Improved Fuzzy Vault Scheme in the Presence of Record Multiplicity (Full Version)
• Factorization of polynomials over finite fields [wikipedia]