Sciweavers

658 search results - page 26 / 132
» The Grindahl Hash Functions
Sort
View
STACS
2012
Springer
12 years 4 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
14 years 6 days ago
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
Michael Szydlo, Yiqun Lisa Yin
IJSN
2007
106views more  IJSN 2007»
13 years 8 months ago
Hash-AV: fast virus signature scanning by cache-resident filters
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...
Ozgun Erdogan, Pei Cao
ACISP
2009
Springer
14 years 3 months ago
Inside the Hypercube
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
Jean-Philippe Aumasson, Eric Brier, Willi Meier, M...
WG
1993
Springer
14 years 18 days ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...