CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
From MaRDI portal
Publication:3626324
DOI10.1142/S1793042109002122zbMATH Open1176.94052MaRDI QIDQ3626324FDOQ3626324
Authors: Abderrahmane Nitaj 
Publication date: 22 May 2009
Published in: International Journal of Number Theory (Search for Journal in Brave)
Recommendations
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Publication:4502495
- An attack on RSA using LSBs of multiples of the prime factors
- Advances in Cryptology - CRYPTO 2003
- A new vulnerable class of exponents in RSA
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Public Key Cryptography - PKC 2005
- Cryptanalysis of short RSA secret exponents
- scientific article; zbMATH DE number 1489842
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Factorization (11Y05)
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with small prime difference
- Title not available (Why is that?)
- Cryptanalysis of `less short' RSA secret exponents
- Advances in cryptology - CRYPTO '95. 15th annual international cryptology conference, Santa Barbara, CA, USA, August 27-31, 1995. Proceedings
Cited In (15)
- New weak RSA keys
- Cryptanalysis of RSA Using the Ratio of the Primes
- An application of Euclidean algorithm in cryptanalysis of RSA
- The better bound of private key in RSA with unbalanced primes
- Public Key Cryptography - PKC 2005
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Cryptanalysis of RSA with more than one decryption exponent
- A unified method for private exponent attacks on RSA using lattices
- A new improved bound for short decryption exponent on RSA modulus \(N = pq\) using Wiener's method
- Application of ECM to a class of RSA keys
- A public key encryption scheme based on factoring and discrete logarithm
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of RSA with multiple small secret exponents
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- Advances in Cryptology – CRYPTO 2004
This page was built for publication: CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626324)
