Partial key exposure attack on short secret exponent CRT-RSA

DOI10.1007/978-3-030-92062-3_4MaRDI QIDQ6157487zbMATH OpenOpenAlexFDO

Authors Alexander May, Julian Nowakowski, Santanu Sarkar

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92062-3_4

zbMATH Keywords

Coppersmith's methodCRT-RSApartial key exposure

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
• Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits
• Partial key exposure attack on CRT-RSA
• New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents

Cites work

• A New Lattice Construction for Partial Key Exposure Attack for RSA
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• A unified framework for small secret exponent attack on RSA
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• 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/
• Cryptanalysis of short RSA secret exponents
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Factoring polynomials with rational coefficients
• Factoring RSA keys from certified smart cards: Coppersmith in the wild
• Finding a small root of a bivariate integer equation; factoring with high bits known
• How to generalize RSA cryptanalyses
• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• scientific article; zbMATH DE number 1942424 (Why is no real title available?)
• Information Security and Privacy
• Maximizing small root bounds by linearization and applications to small secret exponent RSA
• New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
• Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Public Key Cryptography - PKC 2006
• Small CRT-Exponent RSA Revisited
• Small CRT-exponent RSA revisited
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities

Cited in

(16)

• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
• Partial key exposure attack on CRT-RSA
• Attacking Exponent Blinding in RSA without CRT
• New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
• Breaking Goppa-based McEliece with hints
• Decoding McEliece with a hint -- secret Goppa key parts reveal everything
• A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
• A novel partial key exposure attack on common prime RSA
• Sneaking up the ranks: partial key exposure attacks on rank-based schemes
• Solving multivariate Coppersmith problems with known moduli
• Better bounds for finding fixed-degree isogenies via Coppersmith's method
• Small public exponent brings more: improved partial key exposure attacks against RSA
• On the dangers of RSA exponent transforms

This page was built for publication: Partial key exposure attack on short secret exponent CRT-RSA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157487)