Application of ECM to a class of RSA keys

DOI10.1080/09720529.2009.10698223MaRDI QIDQ3561507zbMATH OpenOpenAlexFDO

Authors 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 fractionsCoppersmith's algorithmelliptic curve methodLLL algorithmRSA cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A new vulnerable class of exponents in RSA
• New weak RSA keys
• A new attack on RSA and Demytko's elliptic curve cryptosystem
• CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
• A generalized attack on RSA type cryptosystems

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of `less short' RSA secret exponents
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of RSA with small prime difference
• Cryptanalysis of short RSA secret exponents
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3232020 (Why is no real title available?)
• Parallel integer relation detection: techniques and applications
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities

Cited in

(3)

• A new vulnerable class of exponents in RSA
• A new attack on RSA and Demytko's elliptic curve cryptosystem
• An application of Euclidean algorithm in cryptanalysis of RSA

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

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