Some Plausible Constructions of Double-Block-Length Hash Functions
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 210-225
- https://doi.org/10.1007/11799313_14
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Towards Optimal Double-Length Hash FunctionsLecture Notes in Computer Science, 2005
- A Failure-Friendly Design Principle for Hash FunctionsLecture Notes in Computer Science, 2005
- Some Attacks Against a Double Length Hash ProposalLecture Notes in Computer Science, 2005
- Secure Block Ciphers Are Not Sufficient for One-Way Hash Functions in the Preneel-Govaerts-Vandewalle ModelLecture Notes in Computer Science, 2003
- Analysis of Double Block Length Hash FunctionsLecture Notes in Computer Science, 2003
- Construction of secure and fast hash functions using nonbinary error-correcting codesIEEE Transactions on Information Theory, 2002
- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGVLecture Notes in Computer Science, 2002
- Attacks on Fast Double Block Length Hash FunctionsJournal of Cryptology, 1998
- Fast and secure hashing based on codesPublished by Springer Science and Business Media LLC ,1997
- One Way Hash Functions and DESPublished by Springer Science and Business Media LLC ,1990