Sciweavers

82 search results - page 2 / 17
» On generalized separating hash families
Sort
View
JCT
2008
85views more  JCT 2008»
13 years 6 months ago
A bound on the size of separating hash families
Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinso...
CCS
2009
ACM
14 years 7 months ago
A new hash family obtained by modifying the SHA-2 family
In this work, we study several properties of the SHA-2 design which have been utilized in recent collision attacks against reduced round SHA-2. Small modifications to the SHA-2 des...
Somitra Kumar Sanadhya, Palash Sarkar
MYCRYPT
2005
Springer
248views Cryptology» more  MYCRYPT 2005»
13 years 12 months ago
A Family of Fast Syndrome Based Cryptographic Hash Functions
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
CRYPTO
2004
Springer
108views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based c...
Chun-Yuan Hsiao, Leonid Reyzin
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
13 years 10 months ago
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
Jonathan J. Hoch, Adi Shamir