Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

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
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 11Y16, 11Y05
  • Retrieve articles in all journals with MSC (2010): 11Y16, 11Y05
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