5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.CR2013
PotLLL: 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…
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…