Partial key exposure attacks on RSA with multiple exponent pairs
From MaRDI portal
Recommendations
- A tool kit for partial key exposure attacks on RSA
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure on RSA with private exponents larger than \(N\)
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
Cites work
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Attacking power generators using unravelled linearization: when do we output too much?
- Better lattice constructions for solving multivariate linear equations modulo unknown divisors
- Cryptanalysis of RSA with more than one decryption exponent
- Cryptanalysis of RSA with multiple small secret exponents
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with two decryption exponents
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of variants of RSA with multiple small secret exponents
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Factoring polynomials with rational coefficients
- Finding a small root of a univariate modular equation
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1489842 (Why is no real title available?)
- scientific article; zbMATH DE number 1504818 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- Minkowski sum based lattice construction for multivariate simultaneous Coppersmith's technique and applications to RSA
- Partial key exposure attack on RSA -- improvements for limited lattice dimensions
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Partial key exposure on RSA with private exponents larger than \(N\)
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Using LLL-reduction for solving RSA and factorization problems
Cited in
(11)- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Small CRT-exponent RSA revisited
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- A new attack on RSA with two or three decryption exponents
- A new partial key exposure attack on multi-power RSA
- A tool kit for partial key exposure attacks on RSA
- A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice
- New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Small CRT-Exponent RSA Revisited
- Public Key Cryptography – PKC 2004
This page was built for publication: Partial key exposure attacks on RSA with multiple exponent pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817816)
