J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
The Number Field Sieve, due to Lenstra et al. [LLMP] and Buhler et al. [BLP], is a new routine for factoring integers. We present here a modification of that sieve. We use the fact that certain smoothness computations can be reused, and thereby reduce the asymptotic running time of the Number Field Sieve. We also give a way to precompute tables which will be useful for factoring any integers in a large range. © 1993 International Association for Cryptologic Research.
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences