Small CRT-exponent RSA revisited
From MaRDI portal
Publication:2010590
DOI10.1007/S00145-018-9282-3zbMATH Open1435.94140OpenAlexW2950288557MaRDI QIDQ2010590FDOQ2010590
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
Recommendations
- Small CRT-Exponent RSA Revisited
- Efficient CRT-RSA decryption for small encryption exponents
- Generalized cryptanalysis of small CRT-exponent RSA
- Public Key Cryptography - PKC 2006
- Topics in Cryptology – CT-RSA 2006
- Cryptanalysis of RSA with a small parameter revisited
- scientific article; zbMATH DE number 1942424
- Cryptanalysis of RSA with multiple small secret exponents
- Cryptanalysis of variants of RSA with multiple small secret exponents
- scientific article; zbMATH DE number 1852133
Cites Work
- The Magma algebra system. I: The user language
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Revisiting prime power RSA
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- Cryptanalysis of short RSA secret exponents
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Title not available (Why is that?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Advances in Cryptology - CRYPTO 2003
- Using LLL-reduction for solving RSA and factorization problems
- Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
- An LLL algorithm with quadratic complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Cryptanalysis of Dual RSA
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Improved Results on Cryptanalysis of Prime Power RSA
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
- Cryptanalysis of RSA with Multiple Small Secret Exponents
- Partial prime factor exposure attacks on RSA and its Takagi's variant
- Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
- Finding a Small Root of a Univariate Modular Equation
- A Tool Kit for Partial Key Exposure Attacks on RSA
- 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
- How to Generalize RSA Cryptanalyses
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
- An Improved Analysis on Three Variants of the RSA Cryptosystem
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
- Attacking power generators using unravelled linearization: when do we output too much?
- 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
- Small CRT-Exponent RSA Revisited
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- Information Security and Privacy
- Public Key Cryptography - PKC 2006
- A New Partial Key Exposure Attack on Multi-power RSA
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Partial Key Exposure Attacks on Takagi’s Variant of RSA
Cited In (11)
- Finding small roots for bivariate polynomials over the ring of integers
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Partial key exposure attack on short secret exponent CRT-RSA
- Public Key Cryptography - PKC 2006
- Topics in Cryptology – CT-RSA 2006
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Fast rebalanced RSA signature scheme with typical prime generation
- Small CRT-Exponent RSA Revisited
- Title not available (Why is that?)
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
Uses Software
This page was built for publication: Small CRT-exponent RSA revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010590)
