scientific article; zbMATH DE number 799759

MaRDI QIDQ4847909zbMATH OpenFDO

Authors Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley

Publication date 3 June 1996

zbMATH Keywords

lattice sievingnumber field sieve integer factoring algorithmtrial division

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 475436
• scientific article; zbMATH DE number 475433
• scientific article; zbMATH DE number 1394326
• Analysis of the lattice sieve
• scientific article; zbMATH DE number 1185143

Cited in

(6)

• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• Strategy of relations collection in factoring RSA modulus
• Factoring integers by CVP algorithms
• Analysis of the lattice sieve
• scientific article; zbMATH DE number 475433 (Why is no real title available?)
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847909)