Sciweavers

44 search results - page 9 / 9
» Cryptanalysis of the CFVZ cryptosystem
Sort
View
126
Voted
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
13 years 12 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...
IACR
2011
155views more  IACR 2011»
13 years 11 months ago
Terminating BKZ
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...
117
Voted
ASIACRYPT
2001
Springer
15 years 3 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
108
Voted
USENIX
2007
15 years 2 months ago
POTSHARDS: Secure Long-Term Storage Without Encryption
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public’s desire to digitally record their per...
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller,...