2010

2015

Learn More

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… (More)

- ‹
- 1
- ›