An Implementation of the General Number Field Sieve

  • Authors:

  • Johannes Buchmann;J. Loho;J. Zayer

  • Affiliations:

  • -;-;-

  • Venue:
  • CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
  • Year:
  • 1993

  • The number field sieve

    STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Quantified Score

Hi-index 0.01

Visualization

Abstract

It was shown in [2] that under reasonable assumptions the general number field sieve (GNFS) is the asymptotically fastest known factoring algorithm. It is, however, not known how this algorithm behaves in practice. In this report we describe practical experience with our implementation of the GNFS whose first version was completed in January 1993 at the Department of Computer Science at the Universit盲t des Saarlandes.