Application of ECM to a class of RSA keys

DOI10.1080/09720529.2009.10698223zbMath1198.94118OpenAlexW2115548833MaRDI QIDQ3561507

Abderrahmane Nitaj

Publication date: 25 May 2010

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2009.10698223

zbMATH Keywords

continued fractionsLLL algorithmRSA cryptosystemelliptic curve methodCoppersmith's algorithm

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

An application of Euclidean algorithm in cryptanalysis of RSA

Cites Work

• Unnamed Item
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Cryptanalysis of `less short' RSA secret exponents
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• Parallel integer relation detection: Techniques and applications
• Cryptanalysis of short RSA secret exponents
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/

This page was built for publication: Application of ECM to a class of RSA keys