On the Security of Hash Functions Employing Blockcipher Postprocessing

DOI10.1007/978-3-642-21702-9_9zbMath1282.94036OpenAlexW168128689MaRDI QIDQ3013082

Mridul Nandi, Donghoon Chang, Mordechai M. Yung

Publication date: 7 July 2011

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21702-9_9

zbMATH Keywords

PRPPROcomputable message awarenessPrA

Mathematics Subject Classification ID

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

Related Items (2)

Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ On the Security of Hash Functions Employing Blockcipher Postprocessing

Uses Software

• Skein Hash

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Security of Hash Functions Employing Blockcipher Postprocessing
• On the Indifferentiability of the Grøstl Hash Function
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Salvaging Merkle-Damgård for Practical Applications
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• Towards Optimal Double-Length Hash Functions
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Theory of Cryptography

This page was built for publication: On the Security of Hash Functions Employing Blockcipher Postprocessing