.png){kind=icon}
Return
A fast and efficient chaos-based keyed hash function
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cnsns.2012.06.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new chaotic keyed hash function based on a single 4-dimensional chaotic cat map whose irregular outputs are used to compute a hash value. The suggested scheme is fast, efficient and flexible. It takes an input message of arbitrary length and returns a hash value of a fixed length n, where n is a multiple of 32 (by convention, n is usually one of the numbers 128, 160, 256, 512, and 1024). Simulation results are presented to demonstrate the suggested hashing scheme's high sensitivity to the original message and the secret key, as well as its strong capability for confusion and diffusion, and very strong collision resistance. In comparison with existing work, especially those based on chaotic maps, the proposed scheme exhibits superior performance. (c) 2012 Elsevier B.V. All rights reserved.
Keywords:
Chaos
Cryptography
Keyed hash function
4-Dimensional chaotic cat map
Journal
IF:
3.8
Papers:
9.3K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more