返回
A structure-based chaotic hashing scheme
DOI:10.1007/s11071-015-1970-z.png)
摘要
En 中文
We propose a new chaotic keyed hashing scheme based on the structure of the input message. The structure of the message is identified with maps of the appearances of each character throughout the input message. We use a 2-dimensional generalized cat map whose chaotic orbits are used to introduce randomness to the computation of the hash value and hence facilitate uniform sensitivity of the hash value to the input message and the secret key. Our proposed hashing scheme is fast, efficient, and flexible. Empirical results verify the high sensitivity of the proposed hash function to the input message and the secret key. Further simulations presented demonstrate the strong capability of the proposed scheme for confusion, diffusion, and collision resistance. Compared with existing schemes, especially those based on chaotic maps, the proposed scheme is shown to have superior performance.
Keyword:
Cryptography
Keyed hash function
Chaotic maps
Cat map
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
1.4W
被引数:
4.1W

