A unified framework for small secret exponent attack on RSA
From MaRDI portal
Recommendations
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Low secret exponent RSA revisited
- Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt '99
- Cryptanalysis of RSA with multiple small secret exponents
- Simplification of the lattice based attack of Boneh and Durfee for RSA cryptoanalysis
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A unified framework for small secret exponent attack on RSA
- Attacking power generators using unravelled linearization: when do we output too much?
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Factoring polynomials with rational coefficients
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Finding small roots of univariate modular equations revisited
- Low secret exponent RSA revisited
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Cited in
(10)- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- A unified framework for small secret exponent attack on RSA
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Attacks on the Search RLWE Problem with Small Errors
- Low secret exponent RSA revisited
- Small CRT-Exponent RSA Revisited
- Partial key exposure attack on short secret exponent CRT-RSA
- Small public exponent brings more: improved partial key exposure attacks against RSA
This page was built for publication: A unified framework for small secret exponent attack on RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889876)