scientific article; zbMATH DE number 1759342

MaRDI QIDQ4536282zbMATH OpenFDO

Authors James Cowie, Bruce A. Dodson, Reina-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Jörg Zayer, Peter L. Montgomery

Publication date 26 January 2004

zbMATH Keywords

RSA public key cryptosystemsnumber field sieve factoringRSA130sieving program

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1024054
• scientific article; zbMATH DE number 1024101
• scientific article; zbMATH DE number 1185143
• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 475432

Cited in

(12)

• Analysis of Bernstein’s Factorization Circuit
• New ideas for factoring large integers
• Factoring estimates for a 1024-bit RSA modulus
• Factorization using the quadratic sieve algorithm
• FACTORING VIA SUPERENCYRPTION
• ECM on Graphics Cards
• Factoring as a service
• A random number generator based on elliptic curve operations
• scientific article; zbMATH DE number 3950601 (Why is no real title available?)
• A Kilobit Special Number Field Sieve Factorization
• Advances in Cryptology - CRYPTO 2003
• 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 Q4536282)