274 search results - page 4 / 55 » Counting lattice vectors |
IACR
2011
12 years 10 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
ICIP
1998
IEEE
14 years 3 months ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
STOC
2001
ACM
14 years 11 months ago
2001
ACM
CALC
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...