Sciweavers

112 search results - page 12 / 23
» On the Homological Dimension of Lattices
Sort
View
ORDER
2006
97views more  ORDER 2006»
13 years 6 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
ICASSP
2008
IEEE
14 years 1 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz
LATINCRYPT
2010
13 years 5 months ago
Accelerating Lattice Reduction with FPGAs
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...
Jérémie Detrey, Guillaume Hanrot, Xa...
HPCS
2006
IEEE
14 years 23 days ago
Simulations of Disordered Bosons on Hyper-Cubic Lattices
We address computational issues relevant to the study of disordered quantum mechanical systems at very low temperatures. As an example we consider the disordered BoseHubbard model...
Peter Hitchcock, Erik S. Sørensen
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
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...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...