Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences

DOI10.1007/978-3-642-54631-0_11zbMath1335.11102OpenAlexW197405257MaRDI QIDQ5402971

Jean-Sébastien Coron, Guénaël Renault, Jingguo Bi, Jean-Charles Faugère, Rina Zeitoun, Phong Q. Nguyen

Publication date: 25 March 2014

Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_11

zbMATH Keywords

RSAcomplexityspeedupLLLsmall roots of polynomial equationsCoppersmith's algorithm

Mathematics Subject Classification ID

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

Related Items (max. 100)

Towards faster polynomial-time lattice reduction ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ Fast practical lattice reduction through iterated compression ⋮ Thrackles: An Improved Upper Bound ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

This page was built for publication: Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences