598 search results - page 22 / 120 » Predicting Lattice Reduction |
191
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
128
click to vote
TIT
2010
14 years 10 months ago
2010
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),...
142
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We describe a new approach for rescoring speech lattices — with long-span language models or wide-context acoustic models — that does not entail computationally intensive latt...
122
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
122
click to vote
PKC
2005
Springer
15 years 9 months ago
2005
Springer
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the first (publicly reported) physical experimen...