A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073

DOI10.1007/978-3-540-74143-5_22zbMath1215.94055OpenAlexW2161758817MaRDI QIDQ3612561

Alexander May, Ellen Jochemsz

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_22

zbMATH Keywords

RSAcryptanalysisCoppersmith's methodCRTsmall exponents

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Partial Key Exposure Attack on CRT-RSA ⋮ Fast rebalanced RSA signature scheme with typical prime generation ⋮ Cryptanalytic results on `Dual CRT' and `Common Prime' RSA ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Partial key exposure attack on short secret exponent CRT-RSA ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ An Improved Analysis on Three Variants of the RSA Cryptosystem ⋮ On the security of multi-prime RSA ⋮ Revisiting Wiener’s Attack – New Weak Keys in RSA ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Generalized cryptanalysis of small CRT-exponent RSA

This page was built for publication: A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073