59 search results - page 6 / 12 » Parallel Lattice Basis Reduction |
131
Voted
CRYPTO
2011
Springer
14 years 14 days 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...
120
Voted
IACR
2011
14 years 8 days 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...
103
Voted
ISITA
2010
14 years 10 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 4 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...
100
Voted
TOC
2008
15 years 16 days 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 ...