Generalized cryptanalysis of small CRT-exponent RSA
From MaRDI portal
Publication:2330126
DOI10.1016/j.tcs.2019.07.031zbMath1448.94219OpenAlexW2964114713WikidataQ127443165 ScholiaQ127443165MaRDI QIDQ2330126
Liqiang Peng, Atsushi Takayasu
Publication date: 18 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.07.031
Related Items (2)
Fast rebalanced RSA signature scheme with typical prime generation ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation
Cites Work
- Revisiting prime power RSA
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Cryptanalysis of RSA with two decryption exponents
- Cryptanalysis of RSA with more than one decryption exponent
- Applied cryptography and network security. 7th international conference, ACNS 2009, Paris-Rocquencourt, France, June 2--5, 2009. Proceedings
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- On the optimality of lattices for the Coppersmith technique
- 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
- Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
- How to Generalize RSA Cryptanalyses
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- Finding a Small Root of a Univariate Modular Equation
- A Tool Kit for Partial Key Exposure Attacks on RSA
- Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
- Cryptanalysis of short RSA secret exponents
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- An LLL Algorithm with Quadratic Complexity
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree
- New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
- Cryptanalysis of RSA with Multiple Small Secret Exponents
- Using LLL-Reduction for Solving RSA and Factorization Problems
- Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Advances in Cryptology - CRYPTO 2003
- Small Secret Key Attack on a Variant of RSA (Due to Takagi)
- Information Security and Privacy
- Small CRT-Exponent RSA Revisited
- Public Key Cryptography - PKC 2006
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized cryptanalysis of small CRT-exponent RSA
