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

Abstract

In a seminal work at EUROCRYPT '96, Coppersmith showed how to nd all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security proofs. However, the running time of the algorithm is a high-degree polynomial, which limits experiments: the bottleneck is an LLL… (More)
DOI: 10.1007/978-3-642-54631-0_11

1 Figure or Table

Topics

  • Presentations referencing similar topics