5 citations · 5 across the 5 of their papers we have counts for
Showing 2012 · cs.CRShow all
2 papers · 2 filters
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…
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…