IACR
2011
12 years 4 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...
CRYPTO
2011
Springer
12 years 4 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...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
SCN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
MST
2007
13 years 4 months ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
CRYPTO
2007
Springer
13 years 10 months ago
2007
Springer
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
CRYPTO
2007
Springer
13 years 10 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
ICC
2007
IEEE
13 years 10 months ago
2007
IEEE
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...