59 search results - page 5 / 12 » Parallel Lattice Basis Reduction |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
STOC
1999
ACM
14 years 3 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...
LATINCRYPT
2010
13 years 9 months ago
2010
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...
CRYPTO
2010
Springer
14 years 1 hour ago
2010
Springer
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...