Constructing an Ideal Hash Function from Weak Ideal Compression Functions

DOI10.1007/978-3-540-74462-7_25zbMath1161.68445OpenAlexW1502433349MaRDI QIDQ5429171

Moses Liskov

Publication date: 29 November 2007

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74462-7_25

zbMATH Keywords

compression functionHash functionMerkle-Damgårdzipper hashideal primitivesnon-streamable hash functions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items (10)

Provable Chosen-Target-Forced-Midfix Preimage Resistance ⋮ Unavoidable regularities in long words with bounded number of symbol occurrences ⋮ Generic attacks on hash combiners ⋮ The universality of iterated hashing over variable-length strings ⋮ On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ Hash Functions from Defective Ideal Ciphers ⋮ Security of Digital Signature Schemes in Weakened Random Oracle Models ⋮ On the Weak Ideal Compression Functions ⋮ Leaky Random Oracle (Extended Abstract)

This page was built for publication: Constructing an Ideal Hash Function from Weak Ideal Compression Functions