59 search results - page 6 / 12 » Parallel Lattice Basis Reduction |
102
click to vote
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
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...
IACR
2011
13 years 9 months ago
2011
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...
ISITA
2010
14 years 7 months ago
2010
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
TOC
2008
14 years 9 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...