Cryptanalysis on a parallel keyed hash function based on chaotic maps

Guo, Wei; Wang, Xiaoming; He, Di; Cao, Yang

doi:10.1016/j.physleta.2009.07.016

Cited by 46 publications

(18 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This operation lets the attackers use the privilege of communicative law and practice forgery attack on the hash function. Some of these algorithms are broken by forgery attack [37]. Not only does the proposed algorithm process the whole message from two sides (which leads to high complexity in mixture), but also in the final step, instead of a simple XOR operation, a conditional method is used in order to resist forgery attack in any section of the algorithm.…”

Section: Resistance Of Forgery Attacksmentioning

confidence: 99%

“…In recent years, there has been a considerable advance in the construction of one-way hash functions based on chaotic maps, including 1D piecewise linear/nonlinear chaotic map [27,28], 2D nonlinear piecewise linear chaotic map [29], high-dimensional chaotic map [30], chaotic neural networks [31], hyper chaos [32], and chaos S-Box [33], which indicates extensive effort in constructing hash functions based on different new methods although some of these new algorithms have been proven to be insecure [22,[34][35][36][37].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A novel parallel hash function based on 3D chaotic map

Akhavan

Samsudin

Akhshani

2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

As the core of cryptography, hash function is one of the basic techniques for information security. During the last few years, considerable effort has been devoted to research on chaos-based hash functions. Nevertheless, the corresponding analysis of them lag far behind. In this paper, a new efficient scheme for parallel hash function based on high-dimensional chaotic map is proposed. In the proposed scheme, the confusion as well as the diffusion effect is enhanced significantly by utilizing two nonlinear coupling parameters. Theoretical and experimental results indicate that the proposed scheme can satisfy all performance requirements of hash function such as desired statistical properties and strong collision resistance. At the same time, the proposed scheme can keep the parallel merit and message sensitivity with high potential to be adopted for network security.

show abstract

Section: Resistance Of Forgery Attacksmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A novel parallel hash function based on 3D chaotic map

Akhavan

Samsudin

Akhshani

2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Many chaosbased image cryptosystems are proposed in this field recently [1]- [11]. However, some of them are successfully broken [12]- [17] due to their small key spaces and weakly secure encryption mechanisms. Among these weaknesses, the most serious one is that the key element used in cryptosystem completely depends on the secret key which means that the same key is used to encrypt different plain images.…”

Section: Introductionmentioning

confidence: 99%

A Robust Chaos-Based Image Cryptosystem with an Improved Key Generator and Plain Image Sensitivity Mechanism

Oğraş¹,

Türk²

2017

JIS

View full text Add to dashboard Cite

In this paper, we propose an effective gray image cryptosystem containing Arnold cat map for pixel permutation and an improved Logistic map for the generation of encryption keys to be used for pixel modification. Firstly, a new chaotic map is designed to show better performance than the standard one in terms of key space range, complexity and uniformity. Generated secret key is not only sensitive to the control parameters and initial condition of the improved map but also strongly depend on the plain image characteristic which provides an effective resistance against statistical and differential attacks. Additionally, to get higher encryption strength of the cryptosystem, both confusion and diffusion processes are performed with different keys in every iterations. Theoretical analysis and simulation results confirm that the proposed algorithm has superior security and effectively encrypts and decrypts the gray images as well.

show abstract

“…Since these chaotic maps in cryptanalytic studies reveal security weakness [25][26][27][28][29][30][31][32], we present a chaotic hash function based on the dynamic S-Box (Substitution Box) with variable parameters that is composed of phases of parameter initialization, message processing and hash value generation in this paper. More specifically, we first exploit the piecewise linear chaotic map to obtain four 32-bit initial buffers and 128-bit initial hash value.…”

Section: Introductionmentioning

confidence: 99%

Chaotic hash function based on the dynamic S-Box with variable parameters

Xia

2016

Nonlinear Dyn

View full text Add to dashboard Cite

We present a chaotic hash function based on the dynamic S-Box with variable parameters in this paper. More specifically, we first exploit the piecewise linear chaotic map to obtain four initial buffers and an initial hash value. Then, we divide a randomly chosen message into message blocks and assign the four buffers and current message block to a transfer function to produce variable parameters and initial values of the PWLCM and logistic map for constructing a dynamic S-Box, which is then used for updating the four buffers. After all the message blocks are processed, the final hash value is generated by cascading the buffers and then applying XOR operation with the last hash value. Finally, we conduct performance evaluation on the proposed hash algorithm in terms of sensitivity, confusion and diffusion properties, collision resistances, speed analysis, randomness tests, and comparison with other algorithms, and the results demonstrate that the proposed algorithm has good statistical properties, strong collision resistances and better performance compared with other schemes.

show abstract

Cryptanalysis on a parallel keyed hash function based on chaotic maps

Cited by 46 publications

References 8 publications

A novel parallel hash function based on 3D chaotic map

A novel parallel hash function based on 3D chaotic map

A Robust Chaos-Based Image Cryptosystem with an Improved Key Generator and Plain Image Sensitivity Mechanism

Chaotic hash function based on the dynamic S-Box with variable parameters

Contact Info

Product

Resources

About