Small CRT-Exponent RSA Revisited
From MaRDI portal
Publication:5738972
DOI10.1007/978-3-319-56614-6_5zbMath1415.94463OpenAlexW2593456049MaRDI QIDQ5738972
Yao Lu, Liqiang Peng, Atsushi Takayasu
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_5
Related Items (8)
Fast rebalanced RSA signature scheme with typical prime generation ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Partial key exposure attack on short secret exponent CRT-RSA ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Small CRT-exponent RSA revisited ⋮ Generalized cryptanalysis of small CRT-exponent RSA
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\)
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- 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
- A Unified Framework for Small Secret Exponent Attack on RSA
- Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
- General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA
- A New Partial Key Exposure Attack on Multi-power RSA
- A Tool Kit for Partial Key Exposure Attacks on 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
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- 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
- Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
- 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
- Public Key Cryptography - PKC 2006
This page was built for publication: Small CRT-Exponent RSA Revisited
