March 2015
Beginner to intermediate
840 pages
25h 12m
English
The algorithm described in this subsection overlaps with the LAMBDA method, while being proposed by other authors independently. The problem (6.5.64) can be equivalently formulated as calculating the vector of the given lattice that is closest to a given vector. Recall that for linearly independent vectors
, the lattice
is the set of their linear combinations with integer coefficients
Calculating the Cholesky decomposition of the matrix
and
, we can formulate (6.5.64) as a problem of calculating a vector of the lattice
that is closest to
(closest vector problem, or CVP). Note also that there can be different bases
generating the same lattice . Let ...
Read now
Unlock full access