An Implementation of the Number Field Sieve

DOI10.1080/10586458.1996.10504590zbMath0869.11101OpenAlexW2141848577MaRDI QIDQ2785383

Marije Elkenbracht-Huizing

Publication date: 22 July 1997

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228557

zbMATH Keywords

number field sieveblock Lanczos methodsparse systems of linear equationsalgorithm for factoring large integerscomputing square roots in number fields

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Factorization (11Y05)

Related Items (9)

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ On the coefficients of the polynomial in the number field sieve ⋮ Non-linear polynomial selection for the number field sieve ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Topics in computational algebraic number theory ⋮ Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus ⋮ On polynomial selection for the general number field sieve ⋮ Factorization of the tenth Fermat number

Uses Software

• PARI/GP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• Factoring polynomials with rational coefficients
• Solving linear equations over GF(2): Block Lanczos algorithm
• Algebraische Zahlentheorie
• Prime numbers and computer methods for factorization

This page was built for publication: An Implementation of the Number Field Sieve