HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS
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 o...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Belarusian National Technical University
2017-08-01
|
| Series: | Системный анализ и прикладная информатика |
| Subjects: | |
| Online Access: | https://sapi.bntu.by/jour/article/view/165 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832543648289390592 |
|---|---|
| author | A. V. Sidorenko I. V. Shakinko |
| author_facet | A. V. Sidorenko I. V. Shakinko |
| author_sort | A. V. Sidorenko |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-81f943fd6bb64301a2491676a964e816 |
| institution | Kabale University |
| issn | 2309-4923 2414-0481 |
| language | English |
| publishDate | 2017-08-01 |
| publisher | Belarusian National Technical University |
| record_format | Article |
| series | Системный анализ и прикладная информатика |
| spelling | doaj-art-81f943fd6bb64301a2491676a964e8162025-02-03T11:37:41ZengBelarusian National Technical UniversityСистемный анализ и прикладная информатика2309-49232414-04812017-08-0102546010.21122/2309-4923-2017-2-54-60128HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGSA. V. Sidorenko0I. V. Shakinko1Belarusian State UniversityBelarusian State UniversityA 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.https://sapi.bntu.by/jour/article/view/165dynamic chaoschaotic mappinghashingdata integrityinformation security |
| spellingShingle | A. V. Sidorenko I. V. Shakinko HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS Системный анализ и прикладная информатика dynamic chaos chaotic mapping hashing data integrity information security |
| title | HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS |
| title_full | HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS |
| title_fullStr | HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS |
| title_full_unstemmed | HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS |
| title_short | HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS |
| title_sort | hashing algorithm based on two dimensional chaotic mappings |
| topic | dynamic chaos chaotic mapping hashing data integrity information security |
| url | https://sapi.bntu.by/jour/article/view/165 |
| work_keys_str_mv | AT avsidorenko hashingalgorithmbasedontwodimensionalchaoticmappings AT ivshakinko hashingalgorithmbasedontwodimensionalchaoticmappings |