34 search results - page 2 / 7 » On the Power of Memory in the Design of Collision Resistant ... |
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Due to recent breakthroughs in hash functions cryptanalysis, some new hash schemes have been proposed. GRINDAHL is a novel hash function, designed by Knudsen, Rechberger and Thomse...
SBBD
2008
13 years 6 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
ACISP
2007
Springer
13 years 11 months ago
2007
Springer
Recent advances in hash functions cryptanalysis provide a strong impetus to explore new designs. This paper describes a new hash function mq-hash that depends for its security on t...
FSE
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the...
IACR
2011
12 years 4 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...