A general number field sieve implementation

D.J. Bernstein, A.K. Lenstra

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    41 Citations (Scopus)
    5 Downloads (Pure)

    Abstract

    The general number field sieve is the asymptotically fastest—and by far most complex—factoring algorithm known. We have implemented this algorithm, including five practical improvements: projective polynomials, the lattice sieve, the large prime variation, character columns, and the positive square root method. In this paper we describe our implementation and list some factorizations we obtained, including the record factorization of 2523 - 1.
    Original languageEnglish
    Title of host publicationThe development of the number field sieve
    EditorsA.K. Lenstra, H.W. Lenstra
    Place of PublicationBerlin
    PublisherSpringer
    Pages103-126
    ISBN (Print)3-540-57013-6
    DOIs
    Publication statusPublished - 1993

    Publication series

    NameLecture Notes in Mathematics
    Volume1554
    ISSN (Print)0075-8434

    Fingerprint

    Dive into the research topics of 'A general number field sieve implementation'. Together they form a unique fingerprint.

    Cite this