72 search results - page 14 / 15 » Practical Cryptanalysis of SFLASH |
210
click to vote
IACR
2011
13 years 11 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
113
click to vote
IACR
2011
13 years 11 months ago
2011
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...
114
click to vote
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
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...
122
click to vote
CRYPTO
2011
Springer
13 years 11 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...
112
click to vote
IACR
2011
13 years 11 months 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...