19 citations · 21 across the 2 of their papers we have counts for
2 papers
math.NT2008★ 2 cited
Using the smoothness of p-1 for computing roots modulo p
Bartosz Zralek
We prove, without recourse to the Extended Riemann Hypothesis, that the projection modulo of any prefixed polynomial with integer coefficients can be completely factored in det…
math.NT2007★ 19 cited
A deterministic version of Pollard's p-1 algorithm
Bartosz Zralek
In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's algori…