Fast Factoring of Integers
classification
⚛️ physics.gen-ph
keywords
algorithmapproximatelydigitsexponentialexponentiallyfactorfactoringfast
read the original abstract
An algorithm is given to factor an integer with $N$ digits in $\ln^m N$ steps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are exponentially slower. An improvement with the aid of an a particular function would provide a further exponential speedup.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.