Title
Analysis of the Hash Function Design Strategy Called SMASH
Abstract
The hash function design strategy SMASH was recently proposed as an alternative to the MD4 family of hash functions. It can be shown that the strategy leads to designs that are vulnerable to efficient collision and (second) preimage attacks. The mathematical structure of the SMASH description facilitates the description of the weakness and the resulting attacks, but also functions with less mathematical elegance may show similar weaknesses.
Year
DOI
Venue
2008
10.1109/TIT.2008.926420
IEEE Transactions on Information Theory
Keywords
Field
DocType
hash function design strategy,similar weakness,hash function,efficient collision,md4 family,mathematical structure,mathematical elegance,preimage attack,smash description,object recognition,prediction algorithms,sections,algorithm design and analysis,cryptanalysis,construction,polynomials,galois fields,resistance,cryptography,security,vectors,hash functions,computational modeling,finite element methods
SHA-2,Double hashing,Computer science,Collision resistance,Cryptographic hash function,Theoretical computer science,SWIFFT,Hash function,Collision attack,Preimage attack
Journal
Volume
Issue
ISSN
54
8
0018-9448
Citations 
PageRank 
References 
5
0.53
14
Authors
4
Name
Order
Citations
PageRank
Mario Lamberger128925.55
Norbert Pramstaller247833.36
Rechberger, C.3131.97
Lars R. Knudsen4908.42