Security of iterated hash functions based on block ciphers

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

Volumn 773 LNCS, Issue , 1994, Pages 379-390

  Hohl, Walter ^a   Lai, Xuejia ^a   Meier, Thomas ^a   Waldvogel, Christian ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BLOCK CIPHERS; BLOCK LENGTHS; COLLISION ATTACK; COMPUTATIONAL SECURITY; CRYPTOGRAPHIC HASH FUNCTIONS; FREE-START COLLISION; LOWER COMPLEXITY; ROUND FUNCTIONS;

HASH FUNCTIONS;

EID: 84957799016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48329-2_32     Document Type: Conference Paper

References (15)

1. L. Brown, J. Pieprzyk and J. Seberry, “LOK1-A Cryptographic Primitive for Authentication and Secrecy Applications”, Advances in Cryptology-AUSCRYPT’90 Proceedings, pp. 229-236, Springer-Verlag, 1990. [Damgaard 90]
2. I.B. Damgaard, “A Design Principle for Hash Functions”, Advances in Cryptology-CRYPT0'89 Proceedings, pp. 416-427, Springer-Verlag, 1990. [Davies 85]
3. R.W. Davies and W.L. Price, “Digital Signature-an Update”, Proc. International Conference on Computer Communications, Sydney, Oct. 1984, Elsevier, North Holland, pp. 843-847, 1985.
4. ISO/IEC CD 10118, Information technology-Security techniques-Hash-functions, I.S.O., 1991.
5. X. Lai and J.L. Massey, “Hash Functions Based on Block Ciphers”, Advances in Cryptology-EUROCRYPT’92 Proceedings, pp. 55-70, LNCS 658, Springer-Verlag, 1993.
6. S.M. Matyas, C.H. Meyer and J. Oseas, “Generating Strong One-Way Functions with Cryptographic Algorithm”, IBM Technical Disclosure Bulletin, Vol. 27, No. 10A, pp. 5658-5659, March 1985.
7. S.M. Matyas, “Key Processing with Control Vectors”, Journal of Cryptology, Vol. 3, No. 2, pp. 113-136, 1991.
8. R.C. Merkle, “One-Way Hash Functions and DES”, Advances in Cryptology-CRYPTO’89 Proceedings, pp. 428-446, Springer-Verlag, 1990. [Meyer 88]
9. C. H. Meyer and M. Schilling, “Secure Program Code with Modification Detection Code”, Proceedings of SECURICOM 88, pp. 111-130, SEDEP.8, Rue de la Michodies, 75002, Paris, France.
10. S. Miyaguchi, K. Ohta and M. Iwata, Confirmation that Some Hash Functions Are Not Collision Free, Advances in Cryptology-EUROCRYPT '90, Proceedings, LNCS 473, pp. 326-343, Springer Verlag, Berlin, 1991.
11. M. Naor and M. Yung, “Universal One-way Hash Functions and Their Cryptographic Applications”, Proc. 21 Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 15-17, 1989, pp. 33-43.
12. B. Preneel, A. Bosselaers, R. Govaerts and J. Vandewalle, “Collision-Free Hashfunctions Based on Blockcipher Algorithm”, Proceedings of 1989 International Carnahan Conference on Security Technology, pp. 203-210, 1989.
13. B. Preneel, Analysis and Design of Cryptographic Hash Hashfunctions, Ph.D. thesis, Katholieke Universiteit Leuven, Belgium, January 1993. [Quisquater 89]
14. J.J. Quisquater and M. Girault, "2n-bit Hash Functions Using n-bit Symmetric Block Cipher Algorithms”, Abstracts of EUROCRYPT’89. [Winternitz 84]
15. R.S. Winternitz, “Producing One-Way Hash Function from DES”, Advances in Cryptology-CRYPTO’83 Proceedings, pp. 203-207, Plenum Press, New York, 1984.