User menu

Finding roots in Fpn with the successive resultants algorithm

Bibliographic reference Petit, Christophe. Finding roots in Fpn with the successive resultants algorithm. In: London Mathematical Society. Journal of Computation and Mathematics, Vol. 17, no. SPEC. ISSUE A, p. 203-217 (2014)
Permanent URL
  1. Berlekamp E. R., Factoring polynomials over large finite fields, 10.1090/s0025-5718-1970-0276200-x
  2. Berlekamp, Algebraic coding theory (1984)
  3. Berlekamp E.R., Rumsey H., Solomon G., On the solution of algebraic equations over finite fields, 10.1016/s0019-9958(67)91016-9
  4. Cantor David G., Zassenhaus Hans, A new algorithm for factoring polynomials over finite fields, 10.1090/s0025-5718-1981-0606517-5
  5. Chen Yuanmi, Nguyen Phong Q., Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers, Advances in Cryptology – EUROCRYPT 2012 (2012) ISBN:9783642290107 p.502-519, 10.1007/978-3-642-29011-4_30
  6. Faugère Jean-Charles, Perret Ludovic, Petit Christophe, Renault Guénaël, Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields, Advances in Cryptology – EUROCRYPT 2012 (2012) ISBN:9783642290107 p.27-44, 10.1007/978-3-642-29011-4_4
  7. Kaltofen Erich, Shoup Victor, Subquadratic-time factoring of polynomials over finite fields, 10.1090/s0025-5718-98-00944-2
  8. Kedlaya Kiran S., Umans Christopher, Fast Polynomial Factorization and Modular Composition, 10.1137/08073408x
  9. Menezes A. J., van Oorschot P. C., Vanstone S. A., Subgroup Refinement Algorithms for Root Finding in $GF(q)$, 10.1137/0221018
  10. Petit, Asiacrypt, 451 (2012)
  11. Rabin Michael O., Probabilistic Algorithms in Finite Fields, 10.1137/0209024
  12. Sch�nhage A., Schnelle Berechnung von Kettenbruchentwicklungen, 10.1007/bf00289520
  13. Sch�nhage Arnold, Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2, 10.1007/bf00289470
  14. Van Oorschot P.C., Vanstone S.A., A geometric approach to root finding in GT(q/sup m/), 10.1109/18.32139
  15. von zur Gathen, Modern computer algebra, 2nd edn (2003)
  16. von zur Gathen Joachim, Panario Daniel, Factoring Polynomials Over Finite Fields: A Survey, 10.1006/jsco.1999.1002
  17. von zur Gathen Joachim, Shoup Victor, Computing Frobenius maps and factoring polynomials, 10.1007/bf01272074
  18. Bosma, Handbook of Magma functions (2013)
  19. Williams, Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC ’12, 887 (2012)