Journal of Cryptology

, Volume 6, Issue 3, pp 169-180

Modifications to the Number Field Sieve

  • Don CoppersmithAffiliated withIBM Research Division, T. J. Watson Research Center

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Key words

Factoring Sieve methods