658 search results - page 56 / 132 » The Grindahl Hash Functions |
COCO
2007
Springer
15 years 7 months ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
92
Voted
SPDP
1993
IEEE
15 years 4 months ago
1993
IEEE
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
105
click to vote
ASIACRYPT
2008
Springer
15 years 2 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
121
Voted
FSE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
90
Voted
FSE
2010
Springer
15 years 5 months ago
2010
Springer
The hash function Blue Midnight Wish (BMW) is a candidate in the SHA-3 competition organised by the U.S. National Institute of Standards and Technology (NIST). BMW was selected fo...