Journal of Cryptology

, Volume 6, Issue 3, pp 169–180

Modifications to the Number Field Sieve

  • Don Coppersmith
Article

DOI: 10.1007/BF00198464

Cite this article as:
Coppersmith, D. J. Cryptology (1993) 6: 169. doi:10.1007/BF00198464

Abstract

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 

Copyright information

© International Association for Cryptologic Research 1993

Authors and Affiliations

  • Don Coppersmith
    • 1
  1. 1.IBM Research DivisionT. J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations