Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration

DOI10.1016/J.DAM.2008.03.038zbMath1163.94428OpenAlexW2056982956MaRDI QIDQ1028435

Palash Sarkar

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.038

zbMATH Keywords

directed acyclic graphcompression functionhash functioncollision resistancecomposition principle

Mathematics Subject Classification ID

Cryptography (94A60) Theory of data (68P99) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

Cites Work

• Some observations on the theory of cryptographic hash functions
• Formalizing Human Ignorance
• Fast Software Encryption
• One Way Hash Functions and DES
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration