On the factorization of RSA-120

DOI10.1007/3-540-48329-2_15MaRDI QIDQ4341744zbMATH OpenFDO

Authors Thomas F. Denny, Bruce A. Dodson, Arjen K. Lenstra, M. S. Manasse

Publication date 18 June 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48329-2_15

zbMATH Keywords

120-digit numberfactorizationnumber field sievequadratic sieve methodRSA-120

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1759342
• Factorization using the quadratic sieve algorithm
• The magic words are squeamish ossifrage. (Extended abstract)
• scientific article; zbMATH DE number 20453
• scientific article; zbMATH DE number 177024

Cited in

(15)

• Modern factorization methods
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• scientific article; zbMATH DE number 3950601 (Why is no real title available?)
• scientific article; zbMATH DE number 4045819 (Why is no real title available?)
• scientific article; zbMATH DE number 4087589 (Why is no real title available?)
• scientific article; zbMATH DE number 20453 (Why is no real title available?)
• The magic words are squeamish ossifrage. (Extended abstract)
• ON FACTORING JEVONS' NUMBER
• Analysis of Bernstein’s Factorization Circuit
• scientific article; zbMATH DE number 1759342 (Why is no real title available?)
• scientific article; zbMATH DE number 2141078 (Why is no real title available?)
• New ideas for factoring large integers
• Factorization using the quadratic sieve algorithm
• Factoring as a service
• Factoring estimates for a 1024-bit RSA modulus

This page was built for publication: On the factorization of RSA-120

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