A parallel algorithm for extending cryptographic hash functions. (Extended abstract)

DOI10.1007/3-540-45311-3_4MaRDI QIDQ4788561zbMATH OpenFDO

Authors Palash Sarkar, Paul J. Schellenberg

Publication date 29 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45311-3_4

zbMATH Keywords

cryptographic hash functiondigital signaturesMerkle-Damgård constructionmessage digestparallel algorithm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Construction of universal one-way hash functions: tree hashing revisited
• On parallel hash functions based on block-cipher
• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Parallel keyed hash function construction based on chaotic maps

Cited in

(1)

• Construction of universal one-way hash functions: tree hashing revisited

This page was built for publication: A parallel algorithm for extending cryptographic hash functions. (Extended abstract)

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