Analysis of the Hash Function Design Strategy Called SMASH

DOI10.1109/TIT.2008.926420MaRDI QIDQ3604762zbMATH OpenWikidataFDO

Authors Mario Lamberger, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2008.926420

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Breaking a New Hash Function Design Strategy Called SMASH
• Fast Software Encryption
• Security analysis of Even-Mansour structure hash functions
• Analysis of Multivariate Hash Functions
• Boomerang and slide-rotational analysis of the SM3 hash function
• Cryptanalysis of hash functions with structures
• scientific article; zbMATH DE number 4195165
• A Failure-Friendly Design Principle for Hash Functions
• Design Strategies for Minimal Perfect Hash Functions

Cited in

(5)

• Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
• Cryptanalysis of Tweaked Versions of SMASH and Reparation
• Smashing MASH-1
• Breaking a New Hash Function Design Strategy Called SMASH
• Fast Software Encryption

This page was built for publication: Analysis of the Hash Function Design Strategy Called SMASH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604762)