122
Voted
IACR
2011
14 years 20 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...
131
Voted
CRYPTO
2011
Springer
14 years 25 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...
109
Voted
TWC
2008
15 years 28 days ago
2008
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...