Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound

DOI10.1016/j.tcs.2018.08.021zbMath1421.94072OpenAlexW2889437918WikidataQ129331854 ScholiaQ129331854MaRDI QIDQ1727391

Noboru Kunihiro, Atsushi Takayasu

Publication date: 20 February 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.08.021

zbMATH Keywords

RSAlatticespartial key exposureCoppersmith's method

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents ⋮ A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation

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\)
• Applied cryptography and network security. 7th international conference, ACNS 2009, Paris-Rocquencourt, France, June 2--5, 2009. Proceedings
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• On the optimality of lattices for the Coppersmith technique
• 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 Tool Kit for Partial Key Exposure Attacks on RSA
• Partial Key Exposure Attack on RSA – Improvements for Limited Lattice Dimensions
• Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
• Cryptanalysis of short RSA secret exponents
• On the security of multi-prime RSA
• Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
• A New Lattice Construction for Partial Key Exposure Attack for RSA
• 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
• 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
• Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Advances in Cryptology - CRYPTO 2003
• Small Secret Key Attack on a Variant of RSA (Due to Takagi)
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Small CRT-Exponent RSA Revisited

This page was built for publication: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound