Small public exponent brings more: improved partial key exposure attacks against RSA
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- A unified framework for small secret exponent attack on RSA
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Attacking power generators using unravelled linearization: when do we output too much?
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of RSA with small prime difference
- Cryptanalysis of short RSA secret exponents
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Factoring polynomials with rational coefficients
- Fast practical lattice reduction through iterated compression
- Finding a small root of a univariate modular equation
- How to generalize RSA cryptanalyses
- scientific article; zbMATH DE number 3569835 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1302834 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Partial key exposure attack on short secret exponent CRT-RSA
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving linear equations modulo unknown divisors: revisited
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Survey: recovering cryptographic keys from partial information, by example
This page was built for publication: Small public exponent brings more: improved partial key exposure attacks against RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326396)
