Sciweavers

713 search results - page 8 / 143
» Dispersing Hash Functions
Sort
View
144
Voted
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 4 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
91
Voted
ICNP
1997
IEEE
15 years 7 months ago
Traffic Dispersion and Its Impact on ATM Protocol Functions
Eva Gustafsson, Gunnar Karlsson
143
Voted
AC
1997
Springer
15 years 7 months ago
Cryptographic Primitives for Information Authentication - State of the Art
This paper describes the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signat...
Bart Preneel
150
Voted
ASIACRYPT
1992
Springer
15 years 7 months ago
On the Power of Memory in the Design of Collision Resistant Hash Functions
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...
Bart Preneel, René Govaerts, Joos Vandewall...
139
Voted
AC
1998
Springer
15 years 3 months ago
The State of Cryptographic Hash Functions
This paper describes the state of the art for cryptographic hash functions. Different definitions are compared, and the few theoretical results on hash functions are discussed. A...
Bart Preneel