126 search results - page 14 / 26 » SMASH - A Cryptographic Hash Function |
FSE
2009
Springer
13 years 11 months ago
2009
Springer
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
ARITH
2005
IEEE
13 years 9 months ago
2005
IEEE
Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on ...
CRYPTO
2003
Springer
14 years 26 days ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
EIT
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...