Theoretical and Experimental Analysis of Cryptographic Hash Functions
DOI:
https://doi.org/10.26636/jtit.2019.128018Keywords:
cryptographic hash function, hashing metod, securityAbstract
The paper presents a theoretical introduction to the cryptographic hash function theory and a statistical experimental analysis of selected hash functions. The definition of hash functions, differences between them, their strengths and weaknesses are explained as well. Different hash function types, classes and parameters are described. The features of hash functions are analyzed by performing statistical analysis. Experimental analysis is performed for three certified hash functions: SHA1-160, SHA2-512 and SHA3-512. Such an analysis helps understand the behavior of cryptographic hash functions and may be very helpful for comparing the security level of the hashing method selected. The tests may serve as a basis for examination of each newly proposed hash function. Additionally, the analysis may be harness as a method for comparing future proposals with the existing functions.
Downloads
References
[1] I. Gomaa, “Global information assurance certification paper”, SANS Institute, May 2011.
View in Google Scholar
[2] R. Sobti and G. Ganesan, “Cryptographic hash functions: A review”, Int. J. of Comp. Sci. Issues, vol. 9, no. 2, pp. 461–479, 2012.
View in Google Scholar
[3] J. L. Carter and M. N. Wegman, “Universal classes of hash functions”, J. of Comp. and Syst. Sciences, vol. 18, no. 2, pp. 143–154, 1979.
View in Google Scholar
[4] R. C. Merkle, “Secrecy, authentication, and public key systems”, Ph.D. thesis, Department of Electrical Engineering, Stanford University, CA, USA, 1979 [Online]. Available: http://www.merkle.com/papers/Thesis1979.pdf.
View in Google Scholar
[5] M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications”, March 1995 [Online]. Available: http://www.wisdom.weizmann.ac.il/~naor/PAPERS/uowhf.pdf.
View in Google Scholar
[6] B. Preneel, “Cryptographic hash functions: An overview”, in Proc. of the 6th Int. Comp. Secur. and Virus Conf. ICSVC 1993, Leuven, Belgium, 1993 [Online]. Available: https://www.esat.kuleuven.be/cosic/publications/article-289.pdf.
View in Google Scholar
[7] S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, “Cryptographic hash functions: A survey”, Tech. Rep. 95-09, vol. 4, Department of Computer Science, University of Wollongong, 1995.
View in Google Scholar
[8] S. Matyas, C. Meyer, and J. Oseas, “Generating strong one-way functions with cryptographic algorithm”, IBM Techn. Disclosure Bull., vol. 27, no. 10A, 1985.
View in Google Scholar
[9] S. Wolfram, “Random sequence generation by cellular automata”, Adv. in Appl. Mathem., vol. 7, no. 2, pp. 123–169, 1986.
View in Google Scholar
[10] J. Daemen, R. Govaerts, and J. Vandewalle, “A framework for the design of one-way hash functions including cryptanalysis of Damgård’s one-way function based on a cellular automaton”, in Advances in Cryptology ASIACRYPT 91, H. Imai, R. L. Rivest, and T. Matsumoto, Eds. LNCS, vol. 739, pp. 82–96. Berlin, Heidelberg: Springer, 1993.
View in Google Scholar
[11] B. Preneel, “The first 30 years of cryptographic hash functions and the NIST SHA-3 competition”, in Topics in Cryptology – CT-RSA 2010. The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1–5, 2010. Proceedings, J. Pieprzyk, Ed. LNCS, vol. 5985, pp. 1–14. Berlin, Heidelberg: Springer, 2010.
View in Google Scholar
[12] S. Harari, “Non linear non commutative functions for data integrity”, in Advances in Cryptology, T. Beth, N. Cot, and I. Ingemarsson, Eds. LNCS, vol. 209, pp. 25–32. Berlin, Heidelberg: Springer, 1985.
View in Google Scholar
[13] M. S. Turan et al., “NISTIR 7764: Status report on the second round of the SHA-3 cryptographic hash algorithm competition”, Tech. Rep., NIST, 2011.
View in Google Scholar
[14] “Announcing request for candidate algorithm nominations for a new cryptographic hash algorithm (SHA-3) family”, Tech. Rep., NIST, 2007.
View in Google Scholar
[15] S. J. Chang et al., “NISTIR 7896: Third-round report of the SHA-3 cryptographic hash algorithm competition”, Tech. Rep., NIST, 2012.
View in Google Scholar
[16] FIPS PUB 202: M. J. Dworkin, “SHA-3 standard: Permutation-based hash and extendable-output functions”, Tech. Rep. no. 202, NIST, 2015.
View in Google Scholar
[17] A. K. Lenstra, “Key lengths. Contribution to the handbook of information security”, 2004 [Online]. Available: http://plan9.bell-labs.com/who/akl/key_lengths.pdf.
View in Google Scholar
[18] Bouncy Castle library [Online]. Available: https://www.bouncycastle.org (accessed: 08.2018).
View in Google Scholar
[19] Class SecureRandom [Online]. Available: https://docs.oracle.com/javase/7/docs/api/java/security/SecureRandom.html (accessed: 08.2018).
View in Google Scholar
[20] “Hamming distance and error correcting codes”, Hamming Distance [Online]. Available: http://www.oxfordmathcenter.com/drupal7/node/525 (accessed: 08.2018).
View in Google Scholar
[21] Wald-Wolfowitz series test [Online]. Available: https://www.itl.nist.gov/div898/handbook/eda/section3/eda35d.htm (accessed: 08.2018).
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2019 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
