Analysis of Fast Blockcipher-Based Hash Functions

DOI10.1007/11751595_46MaRDI QIDQ3600119zbMATH OpenOpenAlexFDO

Authors Martin Stanek

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_46

zbMATH Keywords

provable securityhash functionsblack-box model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On high-rate cryptographic compression functions
• Blockcipher-Based Hashing Revisited
• scientific article; zbMATH DE number 503327
• scientific article; zbMATH DE number 1942429
• scientific article; zbMATH DE number 1583800

Cited in

(11)

• Looking Back at a New Hash Function
• scientific article; zbMATH DE number 4132087 (Why is no real title available?)
• Analysis of the Kupyna-256 Hash Function
• On high-rate cryptographic compression functions
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• Blockcipher-Based Hashing Revisited
• Progress in Cryptology - INDOCRYPT 2004
• A synthetic indifferentiability analysis of some block-cipher-based hash functions
• Fast block cipher proposal
• On the Security of Hash Functions Employing Blockcipher Postprocessing
• Attacks on fast double block length hash functions

This page was built for publication: Analysis of Fast Blockcipher-Based Hash Functions

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