Sciweavers

713 search results - page 47 / 143
» Dispersing Hash Functions
Sort
View
ACISP
2007
Springer
15 years 3 months ago
Hash-and-Sign with Weak Hashing Made Secure
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
Sylvain Pasini, Serge Vaudenay
TVLSI
2008
123views more  TVLSI 2008»
14 years 9 months ago
Cost-Efficient SHA Hardware Accelerators
Abstract--This paper presents a new set of techniques for hardware implementations of Secure Hash Algorithm (SHA) hash functions. These techniques consist mostly in operation resch...
Ricardo Chaves, Georgi Kuzmanov, Leonel Sousa, Sta...

Tutorial
2720views
16 years 9 months ago
Hashing Tutorial
This tutorial does more than simply explain hashing and collision resolution. It lets you try out hash functions and collision resolution methods for yourself so that you can reall...
Cliff Shaffer
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 9 months ago
The Power of Simple Tabulation Hashing
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...
Mihai Patrascu, Mikkel Thorup
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 1 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
John Kelsey, Stefan Lucks