SMASH

From The ECRYPT Hash Function Website

Jump to: navigation, search

Contents

1 Specification

  • digest size: 256/512 bits
  • max. message length: < 2128 / < 2256bits
  • compression function: 256/512-bit message block, 256/512-bit chaining variable
  • Specification:

Lars R. Knudsen - SMASH - A Cryptographic Hash Function
In Proceedings of FSE, LNCS 3557, pp. 228-242, Springer, 2005
[Electronic Edition] [Bibtex]
Author : Lars R. Knudsen
Title : SMASH - A Cryptographic Hash Function
In : In Proceedings of FSE -
[Abstract]

2 Cryptanalysis

2.1 Best Known Results

Practical collision and second preimage attacks. No preimage attacks.


2.2 Generic Attacks


2.3 Collision Attacks

Norbert Pramstaller, Christian Rechberger, Vincent Rijmen - Breaking a New Hash Function Design Strategy Called SMASH
In Proceedings of Selected Areas in Cryptography, LNCS 3897, pp. 233-244, Springer, 2005
[Electronic Edition] [Bibtex]
Author : Norbert Pramstaller, Christian Rechberger, Vincent Rijmen
Title : Breaking a New Hash Function Design Strategy Called SMASH
In : In Proceedings of Selected Areas in Cryptography -
[Abstract]

2.4 Second Preimage Attacks

Mario Lamberger, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen - Second Preimages for SMASH
In Proceedings of CT-RSA, LNCS, pp. 101-111, 2007
[Electronic Edition] [Bibtex]
Author : Mario Lamberger, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen
Title : Second Preimages for SMASH
In : In Proceedings of CT-RSA -
[Abstract]

2.5 Preimage Attacks


2.6 Others

Personal tools