HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS
https://doi.org/10.21122/2309-4923-2017-2-54-60
Abstract
A new hashing algorithm based on dynamic chaos is proposed. Owing to the use of chaotic mappings, this algorithm is irreversible and a search for two messages with identical hash-values becomes computationally difficult. The proposed algorithm consists of the stages: selection of the variables and of the parameters of two-dimensional chaotic mappings; realization of iterations of the chaotic mappings with the addition of the original-message elements to the variables; realization of iterations of the chaotic mappings without the addition of the original-message elements to the variables; the hash-value formation. The formation of the two hash-values h1 and h2realized with different orders of the variables. The resultant hash-value is obtained by the modulo-2 addition operation applied to the hash-values h1 and h2. The proposed algorithm has been tested. It has been found that this algorithm is characterized by the avalanche effect. The statistical characteristics of the sequence formed of hash-values are identical to those of the sequence with the randomly obtained values of the elements, pointing to the adequate performance of this algorithm. The computational experiment has been realized using the Chirikov, «Arnold’s cat» and Henon maps. It is demonstrated that, with the use of Henon and «Arnold’s cat» maps for the messages exceeding 4 KB, the proposed algorithm outperforms «Keccak» algorithm, being faster by 20% and more.
The proposed hashing algorithm may be used in solving the problems of data integrity in modern telecommunication systems.
About the Authors
A. V. Sidorenko
Belarusian State University
Belarus
Sidorenko Alevtina Vasilevna – professor, doctor of technical sciencies. Department of Radiophysics and Computer technologies
Belarus
Sidorenko Alevtina Vasilevna – professor, doctor of technical sciencies. Department of Radiophysics and Computer technologies
I. V. Shakinko
Belarusian State University
Belarus
Shakinko Ivan Vladimirovich – post graduate
Belarus
Shakinko Ivan Vladimirovich – post graduate
References
1. Cryptology: textbook / Yu. S. Kharin [et al.]. – Minsk: BSU, 2013. – 511 p.
2. Sobti, R. Cryptographic hash functions: a review / R. Sobti, G. Geetha // International journal of computer science issues. – 2012. – Vol. 2, № 2. – P. 461–479.
3. Pticyn, N. Deterministic chaos theory application to cryptography / N. Pticyn. – Moscow: Bauman MSTU – 2002. – 80 p.
4. One-Way hash function based on cascade chaos / F. Xiang [et al.] // The open cybernetics & systemics journal. – 2015. – Vol. 9. – P. 573–580.
5. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions: FIPS 202. – Publ. 2015-08-01. – Gaithersburg: National Institute of Standards and Technology, 2015. – 29 p.
6. Мао, W. Modern Cryptography: Theory and Practice / W. Мао (edited by Kljushina D. А.). – Moscow: Williams Publishing House. – 2005. – 768 p.
7. On the interpretation of results from the NIST statistical test suite / M. Sys [et al.] // Romanian journal of information science and technology. – 2015. – Vol. 18, № 1. – P. 18–32.
8. Fog, A. Instruction tables: Lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs [Electronic resource] / A. Fog. – Technical University of Denmark, 2016. – Mode of access: http://www.agner.org/optimize/instruction_tables.pdf. – Date of access: 27.03.2017.
9.
Review
For citations:
Sidorenko A.V., Shakinko I.V. HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS. «System analysis and applied information science». 2017;(2):54-60. (In Russ.) https://doi.org/10.21122/2309-4923-2017-2-54-60
Views:
1091
Email this article 