Deterministic root finding in finite fields

DOI10.1145/2850449.2850457zbMath1365.68486OpenAlexW2342913047MaRDI QIDQ5270175

Luca De Feo, Michaël Quisquater, Christophe Petit

Publication date: 22 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2850449.2850457

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Factorization (11Y05)

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Subgroup Refinement Algorithms for Root Finding in $GF(q)$
• On the Efficiency of Algorithms for Polynomial Factoring
• A geometric approach to root finding in GT(q/sup m/)
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: Deterministic root finding in finite fields