Practical attacks on small private exponent RSA: new records and new insights
From MaRDI portal
Publication:6070359
DOI10.1007/s10623-023-01295-5zbMath1527.94049OpenAlexW4386399602MaRDI QIDQ6070359
No author found.
Publication date: 20 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01295-5
binary searchpractical attacksmall private exponent attackMSBs guessmultivalued-continuous phenomena
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of RSA with small prime difference
- Partial prime factor exposure attacks on RSA and its Takagi's variant
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- The Wiener attack on RSA revisited: a quest for the exact bound
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- A Tool Kit for Partial Key Exposure Attacks on RSA
- Cryptanalysis of short RSA secret exponents
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
- Cryptanalysis of RSA and Its Variants
- Efficient Factoring Based on Partial Information
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- A more efficient algorithm for lattice basis reduction
- Floating-Point LLL Revisited
- Algorithmic Number Theory
- Public Key Cryptography – PKC 2004
This page was built for publication: Practical attacks on small private exponent RSA: new records and new insights
