Maximizing small root bounds by linearization and applications to small secret exponent RSA
From MaRDI portal
Publication:3562887
Recommendations
Cited in
(27)- Implicit related-key factorization problem on the RSA cryptosystem
- Improved results on cryptanalysis of prime power RSA
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Attacking RSA with a composed decryption exponent using unravelled linearization
- Small CRT-Exponent RSA Revisited
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- An improved analysis on three variants of the RSA cryptosystem
- A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- A unified framework for small secret exponent attack on RSA
- Further cryptanalysis of a type of RSA variants
- Generalized cryptanalysis of small CRT-exponent RSA
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Cryptanalysis of Dual RSA
- Continued fractions applied to a family of RSA-like cryptosystems
- Small CRT-exponent RSA revisited
- A security analysis of two classes of RSA-like cryptosystems
- Partial key exposure attack on short secret exponent CRT-RSA
- Practical attacks on small private exponent RSA: new records and new insights
- On optimal bounds of small inverse problems and approximate GCD problems with higher degree
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- A unified method for private exponent attacks on RSA using lattices
This page was built for publication: Maximizing small root bounds by linearization and applications to small secret exponent RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562887)