most citedA Polynomial Time Version of LLL With Deep Insertions

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CR2012★ 5 cited

A Polynomial Time Version of LLL With Deep Insertions

Felix Fontein, Michael Schneider, Urs Wagner

Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm…