Difference between revisions of "SMASH"

Revision as of 20:40, 10 March 2008

Lars R. Knudsen - SMASH - A Cryptographic Hash Function

FSE 3557:228-242,2005

Author : Lars R. Knudsen
Title : SMASH - A Cryptographic Hash Function
In : FSE -
Address :
Date : 2005

Mario Lamberger, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen - Second Preimages for SMASH

CT-RSA pp. 101-111,2007

Author : Mario Lamberger, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen
Title : Second Preimages for SMASH
In : CT-RSA -
Address :
Date : 2007

@@ Line 1: / Line 1: @@
 == Specification ==
-<!--
 * digest size: 160 bits
 * max. message length: < 2<sup>64</sup> bits
 * compression function: 512-bit message block, 160-bit chaining variable
 * Specification:
--->
+<bibtex>
+@inproceedings{fseKnudsen05,
+  author    = {Lars R. Knudsen},
+  title     = {SMASH - A Cryptographic Hash Function},
+  pages     = {228-242},
+  url        = {http://dx.doi.org/10.1007/11502760_15},
+  editor    = {Henri Gilbert and Helena Handschuh},
+  booktitle = {FSE},
+  publisher = {Springer},
+  series    = {LNCS},
+  volume    = {3557},
+  year      = {2005},
+  isbn      = {3-540-26541-4},
+  abstract  = {This paper presents a new hash function design, which is different from the popular designs of the MD4-family. Seen in the light of recent attacks on MD4, MD5, SHA-0, SHA-1, and on RIPEMD, there is a need to consider other hash function design strategies. The paper presents also a concrete hash function design named SMASH. One version has a hash code of 256 bits and appears to be at least as fast as SHA-256.},
+}
+</bibtex>
 == Cryptanalysis ==