76 search results - page 9 / 16 » A sieve algorithm for the shortest lattice vector problem |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
TWC
2008
13 years 8 months ago
2008
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...