Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 330-342
- https://doi.org/10.1007/11496618_24
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- 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
- Tweakable Block CiphersLecture Notes in Computer Science, 2002
- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGVLecture Notes in Computer Science, 2002
- Security of Iterated Hash Functions Based on Block CiphersPublished by Springer Science and Business Media LLC ,2001
- A Design Principle for Hash FunctionsPublished by Springer Science and Business Media LLC ,2001
- Hash Functions Based on Block CiphersPublished by Springer Science and Business Media LLC ,2001
- 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
- Hash functions based on block ciphers and quaternary codesPublished by Springer Science and Business Media LLC ,1996