Mathematics – Number Theory
Scientific paper
2007-07-27
Mathematics
Number Theory
Expanded and heavily revised version, to appear in Mathematics of Computation, 21 pages
Scientific paper
10.1090/S0025-5718-09-02262-5
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 $p-1$ algorithm, which finds in random polynomial time the prime divisors $p$ of an integer $n$ such that $p-1$ is smooth. We show that these prime factors can be recovered in deterministic polynomial time. We further generalize this result to give a partial derandomization of the $k$-th cyclotomic method of factoring ($k\ge 2$) devised by Bach and Shallit. We also investigate reductions of factoring to computing Euler's totient function $\phi$. We point out some explicit sets of integers $n$ that are completely factorable in deterministic polynomial time given $\phi(n)$. These sets consist, roughly speaking, of products of primes $p$ satisfying, with the exception of at most two, certain conditions somewhat weaker than the smoothness of $p-1$. Finally, we prove that $O(\ln n)$ oracle queries for values of $\phi$ are sufficient to completely factor any integer $n$ in less than $\exp\Bigl((1+o(1))(\ln n)^{{1/3}} (\ln\ln n)^{{2/3}}\Bigr)$ deterministic time.
No associations
LandOfFree
A deterministic version of Pollard's p-1 algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A deterministic version of Pollard's p-1 algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A deterministic version of Pollard's p-1 algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-271805