Partial Key Exposure Attack on CRT-RSA
From MaRDI portal
Publication:2945387
DOI10.1007/978-3-319-13039-2_15zbMath1337.94068OpenAlexW2611417055MaRDI QIDQ2945387
Ayineedi Venkateswarlu, Santanu Sarkar
Publication date: 10 September 2015
Published in: Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13039-2_15
latticefactorizationpartial key exposureCRT-RSACoppersmith's techniquesmulti-point evaluation of a polynomial
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
- Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
- Partial Key Exposure: Generalized Framework to Attack RSA
- Reconstructing RSA Private Keys from Random Key Bits
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Cryptanalysis of short RSA secret exponents
- Fully Homomorphic Encryption over the Integers
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Advances in Cryptology - CRYPTO 2003
- Information Security and Privacy
- Theory of Cryptography
- Public Key Cryptography - PKC 2006
This page was built for publication: Partial Key Exposure Attack on CRT-RSA
