A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Faster Lattice Enumeration
[article]
2019
arXiv
pre-print
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. Some of the famous lattice reduction algorithms are LLL and BKZ reductions. We define a class of bases called obtuse bases and show that any lattice basis can be transformed to an obtuse basis in O(n^4) time. A shortest vector s can be written as v_1b_1+...+v_nb_n where b_1,...,b_n are the input
arXiv:1912.01781v1
fatcat:ocn2p37qm5bihkfsuwossx7rtq