Sciweavers

112 search results - page 13 / 23
» On the Homological Dimension of Lattices
Sort
View
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
IACR
2011
155views more  IACR 2011»
12 years 6 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
TIT
2010
105views Education» more  TIT 2010»
13 years 1 months ago
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
Joakim Jalden, Petros Elia
ICIP
1995
IEEE
14 years 8 months ago
A lattice vector quantizer for generalized Gaussian sources
A fixed-rate lattice vector quantizer for generalized Gaussian (GG) sources is presented. By using the contour of counstant probability of a generalized Gaussian source to bound t...
Feng Chen, Zheng Gao, John D. Villasenor
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 6 months ago
On the Proximity Factors of Lattice Reduction-Aided Decoding
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...
Cong Ling