Some observations on the theory of cryptographic hash functions

Designs, Codes, and Cryptography

Volumn 38, Issue 2, 2006, Pages 259-277

  Stinson, D R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Collision; Hash family; Hash function; Preimage

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

COLLISION; HASH FAMILY; HASH FUNCTION; PREIMAGE;

CRYPTOGRAPHY;

EID: 30744432873     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-005-6344-y     Document Type: Article

References (12)

1. M. Bellare and T. Kohno, Hash function balance and its impact on birthday attacks, In Advances in Cryptology - EUROCRYPT 2004, Lecture Notes in Computer Science, Vol. 3027 (2004) pp. 401-418.
2. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, In Proceedings of the First Annual Conference on Computer and Communications Security, ACM Press (1993) pp. 62-73.
3. M. Bellare and P. Rogaway, Optimal asymmetric encryption, In Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science, Vol. 950 (1995) pp. 92-111.
4. D. Brown, Generic groups, collision resistance and ECDSA, Designs, Codes and Cryptography, Vol. 35 (2005) 119-152.
5. I. B. Damgård, A design principle for hash functions, In Advances in Cryptology -CRYPTO '89, Lecture Notes in Computer Science, Vol. 435 (1990) pp. 416-427.
6. D. E. Knuth, The Art of Computer Programming, 3rd edn, Addison-Wesley (1997).
7. G. Laccetti and G. Schmid, On a probabilistic approach to the security analysis of cryptographic hash functions, In Cryptology ePrint Archive, http://eprint.iacr.org/. Report 2004/324.
8. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press (1997).
9. B. Preneel, The state of cryptographic hash functions, In Lectures on Data Security: Modern Cryptology in Theory and Practice, Lecture Notes in Computer Science, Vol. 1561 (1999) pp. 158-182.
10. P. Rogaway and T. Shrimpton, Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision-resistance, In FSE 2004, Lecture Notes in Computer Science Vol. 3017 (2004) pp. 371-388.
11. D. R. Simon, Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In Advances in Cryptology - EUROCRYPT '98. Lecture Notes in Computer Science, Vol. 1403 (1998) pp. 334-345.
12. D. R. Stinson, Cryptography: Theory and Practice, 2nd edn, CRC Press, (2002).