>>214
There's something about CVP/SVP and LLL I never understood though. What is the run-time complexity of the LLL algorithm when searching for short vector in a lattice formed by
n basis vectors of
d integer components such that the short vector has all components smaller than a constant
c?