Open Access
Translator Disclaimer
1996 An implementation of the number field sieve
Marije Elkenbracht-Huizing
Experiment. Math. 5(3): 231-253 (1996).

Abstract

The Number Field Sieve (NFS) is the asymptotically fastest known factoring algorithm for large integers. This article describes an implementation of the NFS, including the choice of two quadratic polynomials, both classical sieving and a special form of lattice sieving (line sieving), the block Lanczos method and a new square root algorithm. Finally some data on factorizations obtained with this implementation are listed, including the record factorization of $12^{151}-1$.

Citation

Download Citation

Marije Elkenbracht-Huizing. "An implementation of the number field sieve." Experiment. Math. 5 (3) 231 - 253, 1996.

Information

Published: 1996
First available in Project Euclid: 17 March 2003

zbMATH: 0869.11101
MathSciNet: MR1426450

Subjects:
Primary: 11Y05

Keywords: factorization , number field sieve

Rights: Copyright © 1996 A K Peters, Ltd.

JOURNAL ARTICLE
23 PAGES


SHARE
Vol.5 • No. 3 • 1996
Back to Top