Sciweavers

713 search results - page 17 / 143
» Dispersing Hash Functions
Sort
View
ASIACRYPT
2008
Springer
14 years 11 months ago
Slide Attacks on a Class of Hash Functions
This paper studies the application of slide attacks to hash functions. Slide attacks have mostly been used for block cipher cryptanalysis. But, as shown in the current paper, they ...
Michael Gorski, Stefan Lucks, Thomas Peyrin
IEEEIAS
2009
IEEE
15 years 4 months ago
One-way Hash Function Construction Based on Conservative Chaotic Systems
: An algorithm for one-way hash function construction based on conservative chaotic system is proposed. The plaintext is divided into a group of message blocks by a fixed length an...
Qing-hua Zhang, Han Zhang, Zhao-hui Li
64
Voted
EUROCRYPT
2006
Springer
15 years 1 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
WEWORC
2007
148views Cryptology» more  WEWORC 2007»
14 years 10 months ago
Preimages for Reduced-Round Tiger
The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function ...
Sebastiaan Indesteege, Bart Preneel
80
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel