A Failure-Friendly Design Principle for Hash Functions
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 474-494
- https://doi.org/10.1007/11593447_26
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Merkle-Damgård Revisited: How to Construct a Hash FunctionLecture Notes in Computer Science, 2005
- On the Possibility of Constructing Meaningful Hash Collisions for Public KeysLecture Notes in Computer Science, 2005
- Collisions of SHA-0 and Reduced SHA-1Lecture Notes in Computer Science, 2005
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n WorkLecture Notes in Computer Science, 2005
- Multicollisions in Iterated Hash Functions. Application to Cascaded ConstructionsLecture Notes in Computer Science, 2004
- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGVLecture Notes in Computer Science, 2002
- On the length of cryptographic hash-values used in identification schemesPublished by Springer Science and Business Media LLC ,2001
- A Design Principle for Hash FunctionsPublished by Springer Science and Business Media LLC ,2001
- Design Validations for Discrete Logarithm Based Signature SchemesLecture Notes in Computer Science, 2000
- One Way Hash Functions and DESPublished by Springer Science and Business Media LLC ,1990