On the Improvement of the BDF Attack on LSBS-RSA
From MaRDI portal
Recommendations
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- scientific article; zbMATH DE number 1617917
- Partial key exposure on RSA with private exponents larger than \(N\)
- On the security of RSA with primes sharing least-significant bits
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Cryptanalysis of RSA with small prime difference
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- scientific article; zbMATH DE number 1617917 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1504546 (Why is no real title available?)
- On the security of RSA with primes sharing least-significant bits
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Public Key Cryptography - PKC 2005
- Small Private-Exponent Attack on RSA with Primes Sharing Bits
- Solving Simultaneous Modular Equations of Low Degree
- The exact security of digital signatures -- how to sign with RSA and Rabin
Cited in
(3)
This page was built for publication: On the Improvement of the BDF Attack on LSBS-RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511153)