658 search results - page 4 / 132 » The Grindahl Hash Functions |
CTRSA
2011
Springer
12 years 11 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
EUROCRYPT
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed...
CHES
2011
Springer
12 years 7 months ago
2011
Springer
This paper proposes spongent – a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construc...
SIAMCOMP
2012
11 years 9 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...