Partial key exposure attack on CRT-RSA
From MaRDI portal
Recommendations
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits
- New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
- Partial key exposure attack on short secret exponent CRT-RSA
- Advances in Cryptology - CRYPTO 2003
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- Advances in Cryptology - CRYPTO 2003
- Better lattice constructions for solving multivariate linear equations modulo unknown divisors
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of the RSA subgroup assumption from TCC 2005
- Factoring polynomials with rational coefficients
- Fast multiplication and its applications
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Fully homomorphic encryption over the integers
- 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 1942424 (Why is no real title available?)
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Information Security and Privacy
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure: generalized framework to attack RSA
- Public Key Cryptography - PKC 2006
- Reconstructing RSA Private Keys from Random Key Bits
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Theory of Cryptography
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(13)- Attacking noisy secret CRT-RSA exponents in binary method
- Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Known–Plaintext–Only Attack on RSA–CRT with Montgomery Multiplication
- scientific article; zbMATH DE number 1962165 (Why is no real title available?)
- Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents
- Applied Cryptography and Network Security
- Attacking Exponent Blinding in RSA without CRT
- New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
- Partial key exposure attack on short secret exponent CRT-RSA
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- Improved CRT-RSA secret key recovery method from sliding window leakage
This page was built for publication: Partial key exposure attack on CRT-RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945387)