658 search results - page 13 / 132 » The Grindahl Hash Functions |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
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...
TPDS
1998
13 years 7 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
FPL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--The second round of the NIST-run public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). This paper present...
AC
1997
Springer
13 years 11 months ago
1997
Springer
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...
ASIACRYPT
1992
Springer
13 years 11 months ago
1992
Springer
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...