A Tool Kit for Partial Key Exposure Attacks on RSA

DOI10.1007/978-3-319-52153-4_4zbMath1360.94333OpenAlexW2593654775MaRDI QIDQ2975796

Noboru Kunihiro, Atsushi Takayasu

Publication date: 12 April 2017

Published in: Topics in Cryptology – CT-RSA 2017 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-52153-4_4

zbMATH Keywords

latticespartial key exposureCoppersmith's methods(multi-prime) RSA

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Practical attacks on small private exponent RSA: new records and new insights ⋮ 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 ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Generalized cryptanalysis of small CRT-exponent RSA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
• How to Generalize RSA Cryptanalyses
• 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
• General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA
• Partial Key Exposure Attack on RSA – Improvements for Limited Lattice Dimensions
• On the security of multi-prime RSA
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Attacks on Multi-Prime RSA with Small Prime Difference
• Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
• Advances in Cryptology - EUROCRYPT 2004
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Advances in Cryptology - CRYPTO 2003
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits

This page was built for publication: A Tool Kit for Partial Key Exposure Attacks on RSA