Small CRT-exponent RSA revisited
From MaRDI portal
Publication:2010590
DOI10.1007/S00145-018-9282-3zbMATH Open1435.94140OpenAlexW2950288557MaRDI QIDQ2010590FDOQ2010590
Authors: Atsushi Takayasu, Yao Lu, Liqiang Peng 
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 (13)
- Finding small roots for bivariate polynomials over the ring of integers
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Generalized cryptanalysis of small CRT-exponent RSA
- 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
- Practical attacks on small private exponent RSA: new records and new insights
- 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)
