CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS

DOI10.1142/S1793042109002122zbMath1176.94052MaRDI QIDQ3626324

Abderrahmane Nitaj

Publication date: 22 May 2009

Published in: International Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

continued fractionscryptanalysisRSA cryptosystemCoppersmith's algorithmBlömer-May attack

Mathematics Subject Classification ID

Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Factorization (11Y05)

Related Items (3)

An application of Euclidean algorithm in cryptanalysis of RSA ⋮ A public key encryption scheme based on factoring and discrete logarithm ⋮ Cryptanalysis of RSA Using the Ratio of the Primes

Cites Work

• Unnamed Item
• Cryptanalysis of `less short' RSA secret exponents
• Cryptanalysis of RSA with small prime difference
• Advances in cryptology - CRYPTO '95. 15th annual international cryptology conference, Santa Barbara, CA, USA, August 27-31, 1995. Proceedings
• 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: CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS