Collision analysis and improvement of a hash function based on chaotic tent map
| Autor: | Yantao Li |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Primary clustering
Computer science Hash buster Hash function Rolling hash 01 natural sciences 010305 fluids & plasmas Collision resistance Collision attack SHA-2 0103 physical sciences Cryptographic hash function Message authentication code Electrical and Electronic Engineering 010301 acoustics Computer Science::Databases Computer Science::Cryptography and Security Secure Hash Algorithm SWIFFT MDC-2 Hash-based message authentication code Atomic and Molecular Physics and Optics Electronic Optical and Magnetic Materials Hash tree Hash chain Hash filter Perfect hash function Algorithm Double hashing |
| Zdroj: | Optik. 127:4484-4489 |
| ISSN: | 0030-4026 |
| Popis: | We analyze the computational collision problem on a hash algorithm based on chaotic tent map, and then present an improvement of the original algorithm in this paper. More specifically, we utilize message extension to enhance the correlation of plaintexts in the message and aggregation operation to improve the correlation of sequences of message blocks, which significantly increase the sensitivity between message and hash values, thereby greatly resisting the collision. Finally, we evaluate the performance of the improved algorithm by computer simulation, and the results show that it can resist the computational collision and can satisfy the requirements of a more secure hash algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect