Abstract
In this paper, a new 2m-bit iterated hash function based on a m-bit block cipher with a 2m-bit key is firstly presented. Different from previous 2mbit hash function based on block ciphers, the hash round function in our proposal utilizes a single underlying block cipher. Secondly, five attacks on the hash function are treated. The results show that its hash round function can completely resist target attack, collision attack and semi-free-start collision attack and the whole scheme can be expected to have ideal computational security against the five attacks when the underlying cipher is assumed to have no weakness. Finally, the implementation of the new hash function is discussed. For the underlying cipher to be easily implemented in both software and hardware, so is the new hash function because only two basic 64-bit algebraic operations are introduced in the hash round function on basis of the cipher.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Davies R, Price W. Digital signature-an Update. Proc. International Conference on Computer Communications, Sydney, Oct. 1984, Elsevier, North- Holland, 1985, pp 843–847.
Matyas S, Meyer C, Oseas J. Generating strong one-way functions with cryptographic algorithm. IBM Technical Disclosure Bulletin, vol 27, no. 10A, 1985, pp 5658–5659.
B Preneel, A Bosselaers, R Govaerts, etal. Collision-free hashfunctions based on blockcipher algorithm. Proc. 1989 International Carnahan Conference on Security Technology, 1989, pp 203–210.
JQuisquater, M.Girault 2n-bit hash functions using n-bit symmetric block cipher algorithm. Advances in Cryptology- EUROCRYPT’89, Proceedings, Springer-Verlag, 1990, 102–109 (Lecture Notes in Computer Science no. 434).
LBrown, JPieprzyk, J.Seberry LOKI - a cryptographic primitive for authentication and secrecy applications. Advances in Cryptology- AUSCRYPT’90, Proceedings, Springer-Verlag, 1990, pp 229–236 (Lecture Nr tes in Computer Science no. 453).
R.Merkle One way hash functions and DES. Advances in Cryptology- CRYPTO’89, Proceedings, Springer-Verlag, 1990, pp 428–446 (Lecture Notes in Computer Science no. 435).
CMeyer, M.Schilling Secure program code with modification detection code. Proc. of SECURICOM’88 SEDEP.8, Rue De la Michodies, 75002, Paris, France, 1988, pp 111–130.
XLai, J.Massey Hash functions based on block ciphers. Advances in Cryptology-EUROCRYPT’92, Proceedings, Springer-Verlag, 1993, pp 55– 70(Lecture Notes in Computer Science no.658).
XLai, J.Massey A proposal for a new block encryption standard. Advances in Cryptology-EUROCRYPT’90, Proceedings, Springer-Verlag, 1991, pp 389–404(Lecture Notes in Computer Science no. 473).
Lai X. On the design and security of block cipher. ETH Series in Information Processing, vol 1, Konstanz: Hartung-Gorre Verlag, 1992.
X.Yi On design and analysis of a new block cipher. Concurrency and Parallelism, Programming, Networking, and Security, Proceedins, ASIAN’96, 1996, pp 213–222(Lecture Notes in Computer Science no. 1179).
I.Damgaard A design principle for hash functions. Advances in Cryptology -CRYPTO’89, Proceedings, 1990, pp 416–427(Lecture Notes in Computer Science no. 435).
MNaor, 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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag London Limited
About this paper
Cite this paper
Yi, X., Lam, KY., Han, YF. (1997). Design, Analysis and Implementation of a New Hash Function Based on Block Cipher. In: Daniel, P. (eds) Safe Comp 97. Springer, London. https://doi.org/10.1007/978-1-4471-0997-6_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0997-6_12
Publisher Name: Springer, London
Print ISBN: 978-3-540-76191-4
Online ISBN: 978-1-4471-0997-6
eBook Packages: Springer Book Archive