scientific article; zbMATH DE number 475436

MaRDI QIDQ4273683zbMATH OpenFDO

Authors Daniel J. Bernstein, Arjen K. Lenstra

Publication date 13 January 1994

zbMATH Keywords

factoring algorithmgeneral number field sievelattice sieve

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• An Implementation of the Number Field Sieve
• scientific article; zbMATH DE number 1024053
• scientific article; zbMATH DE number 733561
• scientific article; zbMATH DE number 475432
• On polynomial selection for the general number field sieve

Cited in

(22)

• RSA: a number of formulas to improve the search for p+q
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• scientific article; zbMATH DE number 1643927 (Why is no real title available?)
• An Implementation of the Number Field Sieve
• The space complexity analysis in the general number field sieve integer factorization
• Strategy of relations collection in factoring RSA modulus
• Mersenne factorization factory
• scientific article; zbMATH DE number 4168803 (Why is no real title available?)
• Optimization strategies for hardware-based cofactorization
• scientific article; zbMATH DE number 1186939 (Why is no real title available?)
• scientific article; zbMATH DE number 1222138 (Why is no real title available?)
• scientific article; zbMATH DE number 1303173 (Why is no real title available?)
• Factoring with Two Large Primes
• scientific article; zbMATH DE number 1113829 (Why is no real title available?)
• A characterization of nonprime powers
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• scientific article; zbMATH DE number 2115073 (Why is no real title available?)
• scientific article; zbMATH DE number 799759 (Why is no real title available?)
• Optimal Parameterization of SNFS
• Improved Stage 2 to P ± 1 Factoring Algorithms
• Higher-dimensional sieving for the number field sieve algorithms
• First-degree prime ideals of composite extensions

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 Q4273683)