Development of a hash algorithm based on cellular automata and chaos theory

Information security, reliability of data transfer are today an important component of the globalization of information technology. Therefore, the proposed work is devoted to highlighting the results of the design and development of a hacking-resistant algorithm to ensure the integrity of informatio...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Yuriy Dobrovolsky, Georgy Prokhorov, Mariia Hanzhelo, Dmytro Hanzhelo, Denis Trembach
Formato:	article
Lenguaje:	EN RU UK
Publicado:	PC Technology Center 2021
Materias:	hashing algorithm chaos theory cellular automata compression function transformation function Technology (General) T1-995 Industry HD2321-4730.9
Acceso en línea:	https://doaj.org/article/56b550b6f1754f22baab54436160d70e
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:56b550b6f1754f22baab54436160d70e
record_format	dspace
spelling	oai:doaj.org-article:56b550b6f1754f22baab54436160d70e2021-11-04T14:13:12ZDevelopment of a hash algorithm based on cellular automata and chaos theory1729-37741729-406110.15587/1729-4061.2021.242849https://doaj.org/article/56b550b6f1754f22baab54436160d70e2021-10-01T00:00:00Zhttp://journals.uran.ua/eejet/article/view/242849https://doaj.org/toc/1729-3774https://doaj.org/toc/1729-4061Information security, reliability of data transfer are today an important component of the globalization of information technology. Therefore, the proposed work is devoted to highlighting the results of the design and development of a hacking-resistant algorithm to ensure the integrity of information transfer via digital technology and computer engineering. To solve such problems, cryptographic hashing functions are used. In particular, elements of deterministic Chaos were introduced into the developed cyclic hashing algorithm. The investigation analyzes in detail the strengths and weaknesses of known hashing algorithms. They are shown to have disadvantages. The main ones are a large number of matches (Hamming (x, y) and the presence of a weak avalanche effect, which lead to a significant decrease in the reliability of the algorithm for hacking. The designed hashing algorithm uses an iterative Merkley-Damgard structure, augmented by the input message to a length multiple of 512 bits. Processing in blocks of 128-bit uses cellular automata with mixed rules of 30, 105 and 90, 150 and takes into account the dependence of the generation of the initial vector on the incoming message. This allows half of the 10,000 pairs of arbitrary messages to have an inverse Hamming distance of 0 to 2. The proposed algorithm is four times slower than the well-known family of "secure hash algorithms." However, computation speed is not a critical requirement for a hash function. Decreasing the sensitivity to the avalanche effect allows the generation time to be approximately halved. Optimization of the algorithm, as well as its testing was carried out using new technologies of the Java programming language (version 15). Suggestions and recommendations for improving this approach to data hashing are given alsoYuriy DobrovolskyGeorgy ProkhorovMariia HanzheloDmytro HanzheloDenis TrembachPC Technology Centerarticlehashing algorithmchaos theorycellular automatacompression functiontransformation functionTechnology (General)T1-995IndustryHD2321-4730.9ENRUUKEastern-European Journal of Enterprise Technologies, Vol 5, Iss 9 (113), Pp 48-55 (2021)
institution	DOAJ
collection	DOAJ
language	EN RU UK
topic	hashing algorithm chaos theory cellular automata compression function transformation function Technology (General) T1-995 Industry HD2321-4730.9
spellingShingle	hashing algorithm chaos theory cellular automata compression function transformation function Technology (General) T1-995 Industry HD2321-4730.9 Yuriy Dobrovolsky Georgy Prokhorov Mariia Hanzhelo Dmytro Hanzhelo Denis Trembach Development of a hash algorithm based on cellular automata and chaos theory
description	Information security, reliability of data transfer are today an important component of the globalization of information technology. Therefore, the proposed work is devoted to highlighting the results of the design and development of a hacking-resistant algorithm to ensure the integrity of information transfer via digital technology and computer engineering. To solve such problems, cryptographic hashing functions are used. In particular, elements of deterministic Chaos were introduced into the developed cyclic hashing algorithm. The investigation analyzes in detail the strengths and weaknesses of known hashing algorithms. They are shown to have disadvantages. The main ones are a large number of matches (Hamming (x, y) and the presence of a weak avalanche effect, which lead to a significant decrease in the reliability of the algorithm for hacking. The designed hashing algorithm uses an iterative Merkley-Damgard structure, augmented by the input message to a length multiple of 512 bits. Processing in blocks of 128-bit uses cellular automata with mixed rules of 30, 105 and 90, 150 and takes into account the dependence of the generation of the initial vector on the incoming message. This allows half of the 10,000 pairs of arbitrary messages to have an inverse Hamming distance of 0 to 2. The proposed algorithm is four times slower than the well-known family of "secure hash algorithms." However, computation speed is not a critical requirement for a hash function. Decreasing the sensitivity to the avalanche effect allows the generation time to be approximately halved. Optimization of the algorithm, as well as its testing was carried out using new technologies of the Java programming language (version 15). Suggestions and recommendations for improving this approach to data hashing are given also
format	article
author	Yuriy Dobrovolsky Georgy Prokhorov Mariia Hanzhelo Dmytro Hanzhelo Denis Trembach
author_facet	Yuriy Dobrovolsky Georgy Prokhorov Mariia Hanzhelo Dmytro Hanzhelo Denis Trembach
author_sort	Yuriy Dobrovolsky
title	Development of a hash algorithm based on cellular automata and chaos theory
title_short	Development of a hash algorithm based on cellular automata and chaos theory
title_full	Development of a hash algorithm based on cellular automata and chaos theory
title_fullStr	Development of a hash algorithm based on cellular automata and chaos theory
title_full_unstemmed	Development of a hash algorithm based on cellular automata and chaos theory
title_sort	development of a hash algorithm based on cellular automata and chaos theory
publisher	PC Technology Center
publishDate	2021
url	https://doaj.org/article/56b550b6f1754f22baab54436160d70e
work_keys_str_mv	AT yuriydobrovolsky developmentofahashalgorithmbasedoncellularautomataandchaostheory AT georgyprokhorov developmentofahashalgorithmbasedoncellularautomataandchaostheory AT mariiahanzhelo developmentofahashalgorithmbasedoncellularautomataandchaostheory AT dmytrohanzhelo developmentofahashalgorithmbasedoncellularautomataandchaostheory AT denistrembach developmentofahashalgorithmbasedoncellularautomataandchaostheory
_version_	1718444838948438016

Development of a hash algorithm based on cellular automata and chaos theory

Ejemplares similares