Towards optimal double-length hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3797 LNCS, Issue , 2005, Pages 77-89

  Nandi, Mridul ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; DATA COMPRESSION; FUNCTIONS; MATHEMATICAL MODELS; RANDOM PROCESSES;

COMPRESSION FUNCTIONS; HASH FUNCTIONS; RANDOM ORACLE MODEL; SECURITY PROPERTIES;

SECURITY OF DATA;

EID: 33646833289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596219_7     Document Type: Conference Paper

References (17)

1. M. Bellare. A Note on Negligible Function. Journal of Cryptology, Springer-Verlag, vol 15, No. 4, pp. 271-284, September 2002.
2. th Annual ACM Symposium on Theory of Computing (STOC), pp. 209-218, 1998.
3. I. B. Damgård. A Design Principle for Hash Functions. Advances in Cryptology - Crypto'89, Lecture Notes in Computer Sciences, vol 435, Springer-Verlag, pp. 416-427, 1989.
4. H. Finney. More problems with hash functions. The cryptographic mailing list, 24 Aug 2004. Available at http://lists.virus.org/cryptography-0408/ msg00124.html.
5. M. Hattori, S. Hirose and S. Yoshida. Analysis of Double Block Lengh Hash Functions. 9th IMA International Conference Cryptographi and Coding, 2003, Lecture Notes in Computer Science, vol 2898, 2003.
6. S. Hirose. Provably Secure Double-Block-Length Hash Functions in a Black-Box Model, 7th International Conference on Information Security and Cryptology, 2004.
7. A. Joux. Multicollision on Iterated Hash Functions. Applications to Cascaded Constructions. Advances in Cryptology - Crypto'04, Lecture Notes in Computer Science, vol 3152, 2004.
8. L. Knudsen, X. Lai and B. Preneel. Attacks on fast double block length hash functions. Journal of Cryptology, vol 11, no-1, winter, 1998.
9. L. Knudsen and B. Preneel. Construction of Secure and Fast Hash Functions Using Nonbinary Error-Correcting Codes. IEEE transactions on information theory, vol 48, No. 9, Sept-2002.
10. S. Lucks. Design principles for Iterated Hash Functions. ePrint Archive Report, 2004. Available at http://eprint.iacr.org/2004/253.
11. R. Merkle. One Way Hash Functions and DES. Advances in Cryptology - Crypto'89, Lecture Notes in Computer Sciences, Vol. 435, Springer-Verlag, pp. 428-446, 1989.
12. C. H. Meyer and M. Schilling. Secure program load with manipulation detection code. Proceedings Securicom, pp. 111-130, 1988.
13. M. Nandi, W. Lee, K. Sakurai and S. Lee. Security Analysis of a 2/3-rate Double Length Compression Function in The Black-Box Model. Fast Software Encryption'05, 2005.
14. M. Nandi and D. R. Stinson. Multicollision Attacks on Generalized Hash Functions. Cryptology ePrint Archive, 2004. Available at http://eprint.iacr.org/ 2004/330.
15. D. R. Stinson. Cryptography: Theory and Practice, Second Edition, CRC Press, Inc.
16. D. R. Stinson. Some observations on the theory of cryptographic hash functions. ePrint Archive Report, 2001. Available at http://eprint.iacr.org/ 2001/020/.
17. T. Satoh, M. Haga and K. Kurosawa. Towards Secure and Fast Hash Functions. IEICE Trans, vol E82-A, No. 1 January, 1999.