Attacking RSA with a composed decryption exponent using unravelled linearization
From MaRDI portal
Recommendations
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A method for obtaining digital signatures and public-key cryptosystems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- An attack on RSA given a small fraction of the private key bits
- Attacking power generators using unravelled linearization: when do we output too much?
- Cryptanalysis of RSA with private key \(d\) less than \(N^{0. 292}\)
- Factoring polynomials with rational coefficients
- Finding small roots of univariate modular equations revisited
- Floating-Point LLL Revisited
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Cited in
(3)
This page was built for publication: Attacking RSA with a composed decryption exponent using unravelled linearization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454586)