Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA

DOI10.1016/J.JNT.2021.01.002zbMATH Open1469.11476arXiv1708.09445OpenAlexW2949397001MaRDI QIDQ1998906FDOQ1998906

Authors: Stephen D. Miller, Ramarathnam Venkatesan, Bhargav P. Narayanan 

Publication date: 9 March 2021

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: We present a principled technique for reducing the lattice and matrix size in some applications of Coppersmith's lattice method for finding roots of modular polynomial equations. Motivated by ideas from machine learning, it relies on extrapolating patterns from the actual behavior of Coppersmith's attack for smaller parameter sizes, which can be thought of as "focus group" testing. When applied to the small-exponent RSA problem, our technique reduces lattice dimensions and consequently running times, and hence can be applied to a wider range of exponents. Moreover, in many difficult examples our attack is not only faster but also more successful in recovering the RSA secret key. We include a discussion of subtleties concerning whether or not existing metrics (such as enabling condition bounds) are decisive in predicting the true efficacy of attacks based on Coppersmith's method. Finally, indications are given which suggest certain lattice basis reduction algorithms (such as Nguyen-Stehl'e's L2) may be particularly well-suited for Coppersmith's method.

Full work available at URL: https://arxiv.org/abs/1708.09445

Recommendations

• scientific article; zbMATH DE number 1852133
• A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice
• scientific article; zbMATH DE number 1341877
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Small CRT-Exponent RSA Revisited

zbMATH Keywords

factoringCoppersmith's methodlattice basis reductionlattice attackssmall exponent RSA

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Factoring polynomials with rational coefficients
• Cryptanalysis of short RSA secret exponents
• Title not available (Why is that?)
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Mathematics of public key cryptography.
• Approximate common divisors via lattices
• An LLL algorithm with quadratic complexity
• Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
• Maximizing small root bounds by linearization and applications to small secret exponent RSA
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• A variant of Wiener's attack on RSA
• Title not available (Why is that?)
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild
• A unified framework for small secret exponent attack on RSA

Cited In (7)

• Forty years of attacks on the RSA cryptosystem: A brief survey
• Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
• Maximizing small root bounds by linearization and applications to small secret exponent RSA
• On the optimality of lattices for the Coppersmith technique
• Lattice Attacks on RSA-Encrypted IP and TCP
• Practical attacks on small private exponent RSA: new records and new insights
• Title not available (Why is that?)

Uses Software

• NTL
• fpLLL

This page was built for publication: Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA

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