Sciweavers

Share
6 search results - page 1 / 2
» Collisions for the LPS Expander Graph Hash Function
Sort
View
EUROCRYPT
2008
Springer
8 years 5 months ago
Collisions for the LPS Expander Graph Hash Function
Jean-Pierre Tillich, Gilles Zémor
SCN
2008
Springer
103views Communications» more  SCN 2008»
8 years 3 months ago
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
Christophe Petit, Kristin Lauter, Jean-Jacques Qui...
IACR
2011
106views more  IACR 2011»
7 years 3 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
GLOBECOM
2008
IEEE
8 years 4 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
STACS
2012
Springer
6 years 11 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...
books