5 citations · 5 across the 5 of their papers we have counts for
6 papers
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…
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…
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…
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…
Natural Density of Rectangular Unimodular Integer Matrices
G. Maze, J. Rosenthal, U. Wagner
In this paper, we compute the natural density of the set of k x n integer matrices that can be extended to an invertible n x n matrix over the integers. As a corollary, we find the…
A Note on the Weighted Harmonic-Geometric-Arithmetic Means Inequalities
Gerard Maze, Urs Wagner
In this note, we derive non trivial sharp bounds related to the weighted harmonic-geometric-arithmetic means inequalities, when two out of the three terms are known. As application…