5 citations · 5 across the 5 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
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…
math.CO2012
Improvements in closest point search based on dual HKZ-bases
Urs Wagner, Gerard Maze
In this paper we review the technique to solve the CVP based on dual HKZ-bases by J. Bloemer. The technique is based on the transference theorems given by Banaszczyk which imply so…
cs.CR2012
Solving the LPN problem in cube-root time
Urs Wagner
In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially c…