Cryptographic and parallel hash function based on cross coupled map lattices suitable for multimedia communication security

Li, Yantao; Ge, Guangfu

doi:10.1007/s11042-018-7122-y

Cited by 37 publications

(12 citation statements)

References 67 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[77] 9359 626 15 0 0 0 0 Ref. [70] 9414 569 17 0 0 0 0 [67]. The keyspace of 256 bits is more than sufficient for the proposed hash function to resist brute force attacks.…”

Section: Collision Analysismentioning

confidence: 99%

A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence

et al. 2021

View full text Add to dashboard Cite

Many chaos-based hash functions have convoluted designs that are not based on proper design principles, complicating the verification of security claims. We address this problem by proposing a hash function based on a chaotic sponge construction and DNA sequence. DNA sequence is used to design state transition rules of a deterministic chaotic finite-state automata (DCFSA), a chaotic structure that enhances the chaoticity of digital chaotic maps. We use a DCFSA configuration consisting of four states associated with logistic maps. Analysis shows that the DCFSA configuration is efficient and has high chaotic complexity. Both DCFSA and DNA are used to design the sponge-based hash function. An input message is transformed into a DNA sequence and divided into fixed-length blocks. Each block is absorbed into a sponge structure via DNA-XOR. The sponge state is then updated with a new DNA sequence by iterating DCFSA as a compression function. Statistical evaluations indicate that the proposed hash function has near-ideal diffusion, confusion, collision resistance and distribution properties. The proposed hash can also extend the provably secure notions of the sponge construction, specifically the indifferentiability from random oracles. Furthermore, the hash function has a high level of performance as compared to other chaosbased hash functions.INDEX TERMS Chaotic map DNA data integrity finite state automata hash function security

show abstract

“…[77] 9359 626 15 0 0 0 0 Ref. [70] 9414 569 17 0 0 0 0 [67]. The keyspace of 256 bits is more than sufficient for the proposed hash function to resist brute force attacks.…”

Section: Collision Analysismentioning

confidence: 99%

A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The normally distributed histogram centered at 64 bits again implies desirable diffusion and confusion properties. [45] 9414 569 17 0 0 0 0 Ref. [27] 9554 404 42 0 0 0 0 Ref.…”

Section: Diffusion and Confusion Testmentioning

confidence: 99%

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

et al. 2020

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

“…Confusion defines the relationship between a message, whereby its corresponding hash code is complex and difficult to predict. Diffusion, on the other hand, explains that the hash value is extremely dependent on the message [23]. Therefore, for good diffusion, a one bit modification on an original input message will lead to a 50% change in the probability of each output bit.…”

Section: E Statistic Analysis Of Confusion and Diffusionmentioning

confidence: 99%

HMNT: Hash Function Based on New Mersenne Number Transform

Maetouq

Daud

2020

IEEE Access

View full text Add to dashboard Cite

In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient and have security flaws (such as a lack of collision resistance or susceptibility to birthday attacks). In the current study, we propose a novel hash function scheme based on a new Mersenne number transform. The suggested hash function called Hash Mersenne Number Transform (HMNT) takes an arbitrary length as input to generate a hash value with variable lengths (128, 256 and 512-bits or longer). The proposed scheme is evaluated in terms of the sensitivity of the hash value to the message, secret key and image, distribution of hashes, confusion and diffusion, robustness against collision and birthday attacks, alongside flexibility. Based on the simulation outcomes, the suggested scheme possess high sensitivity to the original message, the secret key and images, along with strong collision resistance. In conclusion, the proposed hash scheme is simple and efficient compared with the existing hash functions, making it viable for practical implementation.

show abstract

Cryptographic and parallel hash function based on cross coupled map lattices suitable for multimedia communication security

Cited by 37 publications

References 67 publications

A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence

A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence

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

HMNT: Hash Function Based on New Mersenne Number Transform

Contact Info

Product

Resources

About