期刊
IEEE ACCESS
卷 8, 期 -, 页码 113163-113174出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.3002763
关键词
Hash functions; Chaotic communication; Perturbation methods; Cryptography; Automata; Logistics; Chaotic map; cryptography; data integrity; finite state automata; hash function; security
资金
- Ministry of Education Malaysia through the Fundamental Research Grant Scheme (FRGS) [FRGS/1/2019/ICT05/USM/02/1]
In this paper, a new chaos-based hash function is proposed based on a recently proposed structure known as the deterministic chaotic finite state automata (DCFSA). Out of its various configurations, we select the forward and parameter permutation variant, $DCFSA_{FWP}$ due to its desirable chaotic properties. These properties are analogous to hash function requirements such as diffusion, confusion and collision resistance. The proposed hash function consists of six machine states and three simple chaotic maps. This particular structure of DCFSA can process larger message blocks (leading to higher hashing rates) and optimizes its randomness. The proposed hash function is analyzed in terms of various security aspects and compared with other recently proposed chaos-based hash functions to demonstrate its efficiency and reliability. Results indicate that the proposed hash function has desirable statistical characteristics, elevated randomness, optimal diffusion and confusion properties as well as flexibility.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据