arXiv · 0803.0471
Using the smoothness of p-1 for computing roots modulo p
Abstract
We prove, without recourse to the Extended Riemann Hypothesis, that the projection modulo $p$ of any prefixed polynomial with integer coefficients can be completely factored in deterministic polynomial time if $p-1$ has a $(\ln p)^{O(1)}$-smooth divisor exceeding $(p-1)^{{1/2}+δ}$ for some arbitrary small $δ$. We also address the issue of computing roots modulo $p$ in deterministic time.
Explore related subjects
Keep this discovery
Bartosz Zralek. 2008-03-04. Using the smoothness of p-1 for computing roots modulo p. https://arxiv.org/abs/0803.0471
Cite the original work for its findings. Save a collection to share your selection of sources.