Constructing an Ideal Hash Function from Weak Ideal Compression Functions

DOI10.1007/978-3-540-74462-7_25MaRDI QIDQ5429171zbMATH OpenOpenAlexFDO

Authors 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 functionideal primitivesMerkle-Damgårdnon-streamable hash functionszipper hash

Mathematics Subject Classification ID

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

Recommendations

• On the Weak Ideal Compression Functions
• New Constructions for Secure Hash Functions
• scientific article; zbMATH DE number 1722677
• scientific article; zbMATH DE number 1088255
• Merkle-Damgård Revisited: How to Construct a Hash Function

Cited in

(12)

• Generic attacks on hash combiners
• Hash functions from defective ideal ciphers
• Provable chosen-target-forced-midfix preimage resistance
• On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
• On the Weak Ideal Compression Functions
• Unavoidable regularities in long words with bounded number of symbol occurrences
• The universality of iterated hashing over variable-length strings
• Modeling random oracles under unpredictable queries
• Security of Digital Signature Schemes in Weakened Random Oracle Models
• Leaky Random Oracle (Extended Abstract)
• Quantum attacks on hash constructions with low quantum random access memory
• Improving generic attacks using exceptional functions

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

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