Secure block ciphers are not sufficient for one-way hash functions in the Preneel-Govaerts-Vandewalle model

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

Volumn 2595, Issue , 2003, Pages 339-352

  Hirose, Shoichi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; LYAPUNOV METHODS; SECURITY OF DATA;

BLOCK CIPHERS; BLOCK SIZES; CHOSEN-PLAINTEXT ATTACK; GENERAL MODEL; KEY SIZES; ONE WAY HASH FUNCTIONS; PLAINTEXT; UN-KEYED HASH FUNCTIONS;

CRYPTOGRAPHY;

EID: 33644951204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36492-7_22     Document Type: Article

References (10)

1. I. B. Damgård. A design principle for hash functions. In CRYPTO'89, pages 416-427, 1990. Lecture Notes in Computer Science 435.
2. D. Davies and W. L. Price. Digital signatures, an update. In Proceedings of the 5th International Conference on Computer Communication, pages 845-849, 1984.
3. S. M. Matyas, C. H. Meyer, and J. Oseas. Generating strong one-way functions with cryptographic algorithm. IBM Technical Disclosure Bulletin, 27:5658-5659, 1985.
4. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
5. R. C. Merkle. A fast software one-way hash function. Journal of Cryptology, 3:43-58, 1990.
6. C. H. Meyer and M. Schilling. Secure program load with manipulation detection code. In Proceedings of the 6th Worldwide Congress on Computer and Communications Security and Protection (SECURICOM'88), pages 111-130, 1988.
7. B. Preneel. Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, 1993.
8. B. Preneel. The state of cryptographic hash functions. In Lectures on Data Security, pages 158-182, 1998. Lecture Notes in Computer Science 1561.
9. B. Preneel, R. Govaerts, and J. Vandewalle. Hash functions based on block ciphers: A synthetic approach. In CRYPTO'93, pages 368-378, 1994. Lecture Notes in Computer Science 773.
10. D. R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In EUROCRYPT'98, pages 334-345, 1998. Lecture Notes in Computer Science 1403.