Closed Alexander-commits closed 2 years ago
You can but if you're investing exponential memory to store all these vectors, you might as well use the faster sieving algorithm to begin with? We effectively do this, inspecting many short vectors in a ball, in e.g. https://github.com/malb/bdd-predicate/
Is it possible to use fpylll methods such as the enumeration to find many short lattice vectors? Or is it better to use sieving algorithms?