Small CRT-exponent RSA revisited
From MaRDI portal
Publication:2010590
DOI10.1007/s00145-018-9282-3zbMath1435.94140OpenAlexW2950288557MaRDI QIDQ2010590
Liqiang Peng, Atsushi Takayasu, Yao Lu
Publication date: 27 November 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9282-3
Related Items
Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents ⋮ Fast rebalanced RSA signature scheme with typical prime generation ⋮ 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 ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting prime power RSA
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Cryptanalysis of Dual RSA
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Partial prime factor exposure attacks on RSA and its Takagi's variant
- 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
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
- A New Partial Key Exposure Attack on Multi-power RSA
- A Tool Kit for Partial Key Exposure Attacks on RSA
- An Improved Analysis on Three Variants of the RSA Cryptosystem
- Improved Results on Cryptanalysis of Prime Power RSA
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
- 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
- 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 with private key d less than N/sup 0.292/
- On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree
- Partial Key Exposure Attacks on Takagi’s Variant of RSA
- 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
- Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
- Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Information Security and Privacy
- Small CRT-Exponent RSA Revisited
- Public Key Cryptography - PKC 2006
