Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables

DOI10.1007/978-3-540-72540-4_21zbMath1141.94341OpenAlexW2144929873MaRDI QIDQ5429401

Aurélie Bauer, Antoine Joux

Publication date: 29 November 2007

Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_21

zbMATH Keywords

Gröbner basisLattice reductionCoppersmith's algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (7)

Small secret exponent attack on RSA variant with modulus \(N=p^rq\) ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Inferring sequences produced by the quadratic generator ⋮ Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

Uses Software

• FGb

This page was built for publication: Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables