Using partial smoothness of $p-1$ for factoring polynomials modulo $p$
HTML articles powered by AMS MathViewer
- by Bartosz Źrałek PDF
- Math. Comp. 79 (2010), 2353-2359 Request permission
Abstract:
Let an arbitrarily small positive constant $\delta$ less than $1$ and a polynomial $f$ with integer coefficients be fixed. We prove unconditionally that $f$ modulo $p$ can be completely factored in deterministic polynomial time if $p-1$ has a $(\ln p)^{O(1)}$-smooth divisor exceeding $p^\delta$. We also address the issue of factoring $f$ modulo $p$ over finite extensions of the prime field $\mathbb {F}_p$ and show that $p-1$ can be replaced by $p^k-1$ ($k\in \mathbb {N}$) for explicit classes of primes $p$.References
- Eric Bach, Joachim von zur Gathen, and Hendrik W. Lenstra Jr., Factoring polynomials over special finite fields, Finite Fields Appl. 7 (2001), no. 1, 5–28. Dedicated to Professor Chao Ko on the occasion of his 90th birthday. MR 1803933, DOI 10.1006/ffta.2000.0306
- Eric Bach and Jeffrey Shallit, Algorithmic number theory. Vol. 1, Foundations of Computing Series, MIT Press, Cambridge, MA, 1996. Efficient algorithms. MR 1406794
- R. C. Baker and G. Harman, Shifted primes without large prime factors, Acta Arith. 83 (1998), no. 4, 331–361. MR 1610553, DOI 10.4064/aa-83-4-331-361
- E. R. Berlekamp, Factoring polynomials over finite fields, Bell System Tech. J. 46 (1967), 1853–1859. MR 219231, DOI 10.1002/j.1538-7305.1967.tb03174.x
- E. R. Canfield, Paul Erdős, and Carl Pomerance, On a problem of Oppenheim concerning “factorisatio numerorum”, J. Number Theory 17 (1983), no. 1, 1–28. MR 712964, DOI 10.1016/0022-314X(83)90002-1
- David G. Cantor and Hans Zassenhaus, A new algorithm for factoring polynomials over finite fields, Math. Comp. 36 (1981), no. 154, 587–592. MR 606517, DOI 10.1090/S0025-5718-1981-0606517-5
- Sergei Evdokimov, Factorization of polynomials over finite fields in subexponential time under GRH, Algorithmic number theory (Ithaca, NY, 1994) Lecture Notes in Comput. Sci., vol. 877, Springer, Berlin, 1994, pp. 209–219. MR 1322724, DOI 10.1007/3-540-58691-1_{5}8
- Michael R. Fellows and Neal Koblitz, Self-witnessing polynomial-time complexity and prime factorization, Des. Codes Cryptogr. 2 (1992), no. 3, 231–235. MR 1181730, DOI 10.1007/BF00141967
- Martin Fürer, Deterministic and Las Vegas primality testing algorithms, Automata, languages and programming (Nafplion, 1985) Lecture Notes in Comput. Sci., vol. 194, Springer, Berlin, 1985, pp. 199–209. MR 819255, DOI 10.1007/BFb0015745
- Joachim von zur Gathen, Factoring polynomials and primitive elements for special primes, Theoret. Comput. Sci. 52 (1987), no. 1-2, 77–89. MR 918114, DOI 10.1016/0304-3975(87)90081-8
- Sergei Konyagin and Carl Pomerance, On primes recognizable in deterministic polynomial time, The mathematics of Paul Erdős, I, Algorithms Combin., vol. 13, Springer, Berlin, 1997, pp. 176–198. MR 1425185, DOI 10.1007/978-3-642-60408-9_{1}5
- H. W. Lenstra Jr., Finding isomorphisms between finite fields, Math. Comp. 56 (1991), no. 193, 329–347. MR 1052099, DOI 10.1090/S0025-5718-1991-1052099-2
- P. Moree and C. L. Stewart, Some Ramanujan-Nagell equations with many solutions, Indag. Math. (N.S.) 1 (1990), no. 4, 465–472. MR 1106093, DOI 10.1016/0019-3577(90)90014-E
- J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields, Math. Comp. 55 (1990), no. 192, 745–763. MR 1035941, DOI 10.1090/S0025-5718-1990-1035941-X
- Stephen C. Pohlig and Martin E. Hellman, An improved algorithm for computing logarithms over $\textrm {GF}(p)$ and its cryptographic significance, IEEE Trans. Inform. Theory IT-24 (1978), no. 1, 106–110. MR 484737, DOI 10.1109/tit.1978.1055817
- M. Pohst and H. Zassenhaus, Algorithmic algebraic number theory, Encyclopedia of Mathematics and its Applications, vol. 30, Cambridge University Press, Cambridge, 1989. MR 1033013, DOI 10.1017/CBO9780511661952
- J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76 (1974), 521–528. MR 354514, DOI 10.1017/s0305004100049252
- L. Rónyai, Factoring polynomials modulo special primes, Combinatorica 9 (1989), no. 2, 199–206. MR 1030373, DOI 10.1007/BF02124680
- Lajos Rónyai, Factoring polynomials over finite fields, J. Algorithms 9 (1988), no. 3, 391–400. MR 955147, DOI 10.1016/0196-6774(88)90029-6
- René Schoof, Elliptic curves over finite fields and the computation of square roots mod $p$, Math. Comp. 44 (1985), no. 170, 483–494. MR 777280, DOI 10.1090/S0025-5718-1985-0777280-6
- Victor Shoup, On the deterministic complexity of factoring polynomials over finite fields, Inform. Process. Lett. 33 (1990), no. 5, 261–267. MR 1049276, DOI 10.1016/0020-0190(90)90195-4
- Victor Shoup, Smoothness and factoring polynomials over finite fields, Inform. Process. Lett. 38 (1991), no. 1, 39–42. MR 1103697, DOI 10.1016/0020-0190(91)90212-Z
- Bartosz Źrałek, A deterministic version of Pollard’s $p-1$ algorithm, Math. Comp. 79 (2010), no. 269, 513–533. MR 2552238, DOI 10.1090/S0025-5718-09-02262-5
Additional Information
- Bartosz Źrałek
- Affiliation: Institute of Mathematics, Warsaw University, 02-097 Warsaw, Poland
- Email: b.zralek@mimuw.edu.pl
- Received by editor(s): March 17, 2008
- Received by editor(s) in revised form: July 2, 2009
- Published electronically: May 20, 2010
- © Copyright 2010 American Mathematical Society
- Journal: Math. Comp. 79 (2010), 2353-2359
- MSC (2010): Primary 11Y16; Secondary 11Y05
- DOI: https://doi.org/10.1090/S0025-5718-2010-02377-4
- MathSciNet review: 2684368