Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
846979 | Optik - International Journal for Light and Electron Optics | 2016 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Engineering (General)
Authors
Yantao Li,