Lattice-based integer factorisation: an introduction to Coppersmith's method

DOI10.1017/9781108854207.006MaRDI QIDQ5034406zbMATH OpenOpenAlexFDO

Authors Alexander May

Publication date 25 February 2022

Full work available at URL https://www.cambridge.org/core/books/computational-cryptography/latticebased-integer-factorisation-an-introduction-to-coppersmiths-method/00B064E9305974570DE95A01FACC5571

zbMATH Keywords

Coppersmith's methodLLL lattice reduction algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of partitions of integers (05A17)

Recommendations

• Using LLL-reduction for solving RSA and factorization problems
• scientific article; zbMATH DE number 1341877
• Lattice-based cryptanalysis of RSA cryptosystem
• Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
• scientific article; zbMATH DE number 1643920

Cited in

(4)

• Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
• SAT and lattice reduction for integer factorization
• A more complete cryptanalysis of the RSA-polynomial problem
• Solving multivariate Coppersmith problems with known moduli

This page was built for publication: Lattice-based integer factorisation: an introduction to Coppersmith's method

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