Sciweavers

2 search results - page 1 / 1
» Rankin's Constant and Blockwise Lattice Reduction
Sort
View
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Rankin's Constant and Blockwise Lattice Reduction
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...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
109
Voted
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
13 years 10 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...