  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.
