2 search results - page 1 / 1 » Rankin's Constant and Blockwise Lattice Reduction |
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
CRYPTO
2011
Springer
12 years 6 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...