Better polynomials for GNFS
From MaRDI portal
Publication:2792346
DOI10.1090/mcom3048zbMath1377.11125OpenAlexW2007595765WikidataQ128145885 ScholiaQ128145885MaRDI QIDQ2792346
Alexander Kruppa, Paul Zimmermann, Cyril Bouvier, Shi Bai
Publication date: 9 March 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01089507/file/sopt-20140905.pdf
Related Items (4)
Higher-dimensional sieving for the number field sieve algorithms ⋮ Montgomery's method of polynomial selection for the number field sieve ⋮ A new ranking function for polynomial selection in the number field sieve ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Uses Software
Cites Work
- The development of the number field sieve
- Integers without large prime factors
- Some mathematical remarks on the polynomial selection in NFS
- On polynomial selection for the general number field sieve
- Factorization of a 768-Bit RSA Modulus
- The Multiple Polynomial Quadratic Sieve
- Root optimization of polynomials in the number field sieve
- Advances in Cryptology - ASIACRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Better polynomials for GNFS