Sciweavers

713 search results - page 9 / 143
» Dispersing Hash Functions
Sort
View
123
Voted
ICISC
2007
96views Cryptology» more  ICISC 2007»
15 years 5 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen
101
Voted
ACNS
2008
Springer
107views Cryptology» more  ACNS 2008»
15 years 10 months ago
Attacking Reduced Round SHA-256
The SHA-256 hash function has started getting attention recently by the cryptanalysis community
Somitra Kumar Sanadhya, Palash Sarkar
116
Voted
EUROCAST
2007
Springer
108views Hardware» more  EUROCAST 2007»
15 years 9 months ago
A Systems Theoretic Approach to the Design of Scalable Cryptographic Hash Functions
Cryptographic hash functions are security primitives that compute check sums of messages in a strong manner and this way are of fundamental importance for ensuring integrity and au...
Josef Scharinger
SCCC
2002
IEEE
15 years 8 months ago
On the Distribution of Keys by Hashing
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...
Horst H. von Brand
121
Voted
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 7 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher