Deterministic chaotic finite-state automata

Alawida, Moatsum; Samsudin, Azman; Teh, Je Sen; Alshoura, Wafa’ Hamdan

doi:10.1007/s11071-019-05311-z

Cited by 24 publications

(15 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DCFSA combines 1D chaotic maps with deterministic finite automata (DFA) to overcome dynamical degradation and enhance chaotic complexity [39]. 1D chaotic maps such as the logistic map, sine map, and tent map are known as unimodal maps since they only have one critical point for their control parameter.…”

Section: Deterministic Chaotic Finite State Automatamentioning

confidence: 99%

“…DCFSA also depends on similar factors that dictate its configuration which include the number of machine states and state transition rule but includes additional ones such as the number of chaotic maps, symbols and the type of perturbation operation that is associated with each state transition. Out of the ten DCFSA configurations analyzed in [39], we have selected DCFSA FW P to be used in the proposed hash function as it depicts optimal chaotic characteristics. The acronym FW P refers to the type of perturbations that are associated with each state transition, which are forward perturbation (FW ) and parameter perturbation (P).…”

Section: Deterministic Chaotic Finite State Automatamentioning

confidence: 99%

“…The intervals are equally visited, that means the system is ergodic and uniform distribution. DCFSA FW P can generate chaotic behaviors along r ∈ (0, 4] and is ergodic [39]. Thus, we set T = 0.5 to equal selection between two type of perturbation methods.…”

Section: A Dcfsa Fw P Configurationmentioning

confidence: 99%

“…According to the DCFSA description in [39], forward perturbation is used to modify chaotic points after iterating chaotic maps in each machine state. The chaotic point from the prior machine state is used in perturbation function.…”

Section: Figure 3: Buffers In Dcfsa For Perturbation Purposesmentioning

confidence: 99%

“…In this paper, we propose a new chaotic hash function based on deterministic chaotic finite state automata (DCFSA) with dynamic perturbation. DCFSA was originally proposed to enhance 1D chaotic behaviors without using external entropy sources [39], [40]. Out of its various configurations, we select DCFSA FW P due to its various advantages such as large chaotic parameter range, high complexity, better randomness, and elevated nonlinearity.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A New Hash Function Based on Chaotic Maps and Deterministic Finite State Automata

et al. 2020

Self Cite

View full text Add to dashboard Cite

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 FW P 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.

show abstract

Section: Deterministic Chaotic Finite State Automatamentioning

confidence: 99%

Section: Deterministic Chaotic Finite State Automatamentioning

confidence: 99%

Section: A Dcfsa Fw P Configurationmentioning

confidence: 99%

Section: Figure 3: Buffers In Dcfsa For Perturbation Purposesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations