Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
From MaRDI portal
Publication:3617506
DOI10.1007/978-3-642-00730-9_3zbMath1360.94331OpenAlexW2276479108MaRDI QIDQ3617506
Santanu Sarkar, Subhamoy Maitra
Publication date: 24 March 2009
Published in: Information Security and Cryptology – ICISC 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00730-9_3
Related Items
Practical attacks on small private exponent RSA: new records and new insights ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ Small CRT-exponent RSA revisited ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Continued fractions and RSA with small secret exponent
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Cryptanalysis of short RSA secret exponents
- Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A p + 1 Method of Factoring
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Advances in Cryptology - CRYPTO 2003
- Public Key Cryptography - PKC 2005
- Public Key Cryptography – PKC 2004
This page was built for publication: Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
