On the oracle complexity of factoring integers |
| |
Authors: | Ueli M. Maurer |
| |
Affiliation: | (1) Department of Computer Science, Swiss Federal Institute of Technology (ETH), CH-8092 Zurich, Switzerland |
| |
Abstract: | The problem of factoring integers in polynomial time with the help of an infinitely powerful oracle who answers arbitrary questions with yes or no is considered. The goal is to minimize the number of oracle questions. LetN be a given compositen-bit integer to be factored, wheren = log2N. The trivial method of asking for the bits of the smallest prime factor ofN requiresn/2 questions in the worst case. A non-trivial algorithm of Rivest and Shamir requires onlyn/3 questions for the special case whereN is the product of twon/2-bit primes. In this paper, a polynomial-time oracle factoring algorithm for general integers is presented which, for any >0, asks at most n oracle questions for sufficiently largeN, thus solving an open problem posed by Rivest and Shamir. Based on a plausible conjecture related to Lenstra's conjecture on the running time of the elliptic curve factoring algorithm, it is shown that the algorithm fails with probability at mostN–/2 for all sufficiently largeN. |
| |
Keywords: | Oracle complexity number theory factoring elliptic curves cryptography |
本文献已被 SpringerLink 等数据库收录! |
|