Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents

DOI10.1007/978-3-319-28166-7_25zbMath1423.94108OpenAlexW2400050325MaRDI QIDQ2794514

Atsushi Takayasu, Noboru Kunihiro

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28166-7_25

zbMATH Keywords

cryptanalysislatticespartial key exposureCoppersmith's methodCRT-RSA

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents ⋮ Partial key exposure attack on short secret exponent CRT-RSA ⋮ 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 ⋮ 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
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Partial Key Exposure on RSA with Private Exponents Larger Than N
• Partial Key Exposure Attack on RSA – Improvements for Limited Lattice Dimensions
• Cryptanalysis of short RSA secret exponents
• Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• A New Lattice Construction for Partial Key Exposure Attack for RSA
• Efficient Factoring Based on Partial Information
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Advances in Cryptology - EUROCRYPT 2004
• 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
• Information Security and Privacy
• Public Key Cryptography - PKC 2006

This page was built for publication: Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents