| General | |
|---|---|
| Designers | Lars R. Knudsen |
| First published | 2005 |
| Detail | |
| Digest sizes | 256 or 512 bits |
| Best publiccryptanalysis | |
| Collision,[1] Second Preimage[2] | |
SMASH is acryptographic hash function which was created byLars R. Knudsen.[3] SMASH comes in two versions: 256-bit and 512-bit. Each version was supposed to rivalSHA-256 andSHA-512, respectively, however, shortly after the SMASH presentation atFSE 2005, an attack vector against SMASH was discovered which left the hash broken.
The message length was limited to less than 2128 for SMASH-256 and 2256 for SMASH-512.
Input: 256/512-bit message blocks and
The function f is a complex compression function consisting of H-Rounds and L-Rounds usingS-boxes,linear diffusion and variable rotations, details can be found here[3]
TheS-boxes in SMASH are derived versions from theSerpent ones.
This cryptography-related article is astub. You can help Wikipedia byadding missing information. |