We are on the same side. Alternative sieving strategies for the number field sieve

DOI10.1007/978-981-99-8730-6_5MaRDI QIDQ6604871zbMATH OpenFDO

Authors Charles Bouillaguet, Ambroise Fleury, Pierre-Alain Fouque, Paul Kirchner

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-981-99-8730-6_5

zbMATH Keywords

RSA-250 factorization

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Analysis of the lattice sieve
• Predicting the Sieving Effort for the Number Field Sieve
• On a strategy in the sieving procedure for the factorization of large natural numbers
• scientific article; zbMATH DE number 1303173
• scientific article; zbMATH DE number 475432

Cites work

• Algorithmic Cryptanalysis
• An Approximate Probabilistic Model for Structured Gaussian Elimination
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• Factorization of a 768-Bit RSA Modulus
• scientific article; zbMATH DE number 475432 (Why is no real title available?)
• scientific article; zbMATH DE number 475433 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• scientific article; zbMATH DE number 733569 (Why is no real title available?)
• scientific article; zbMATH DE number 5937716 (Why is no real title available?)
• On Integers Free of Large Prime Factors
• Probabilistic Analyses of Lattice Reduction Algorithms
• Sieving Using Bucket Sort
• Statistical properties of friable integers

This page was built for publication: We are on the same side. Alternative sieving strategies for the number field sieve

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