A Chaos-Based Cryptographic Hash Function for Message Authentication

Kwok, H.S.; Tang, Wallace K. S.

doi:10.1142/s0218127405014489

Cited by 38 publications

(18 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

“…These properties granted them to be a good candidate for secure communications. To the best of our knowledge, only a few chaos-based hash functions with high-dimensional dynamical systems have been reported http://asp.eurasipjournals.com/content/2013/1/126 [30,32,38]. For instance, an algorithm for image encryption based on a high-dimensional chaotic map with high efficiency is proposed in [4].…”

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: Introductionmentioning

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

“…In the proposed algorithm of [9], two-dimensional and four-dimensional Cat Chaotic Maps ( ) CATCM are utilized. Two-dimensional generalized CATCM is defined as:…”

Section: Typical Algorithm Threementioning

confidence: 99%

“…According to the performance data provided in [9], this algorithm can generally meet the performance requirement of hash function. But 1-bit change in message leads to only 58.353-bit change in the 128-bit final hash value, which is far from the ideal number 64-bit.…”

Section: The Performance Analysis and Improvementmentioning

confidence: 99%

Chaos Based Hash Function

Xiao

Liao

Deng

2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

Abstract. This chapter focuses on the construction of chaos-based hash function. Hash function is a special kind of one-way function which takes a variable-length input and returns a fixed-length value. As one of the cores of Cryptography, hashing is a basic technique widely used in information security. Utilizing chaos to construct hash function is a promising direction which attracts more and more attention. In this chapter, some preliminaries on hash function are firstly given in brief. Then, the systemic descriptions of different chaos-based construction approaches are presented in the order of the simple chaotic map-based hash function, the complex map-based hash function, the composite map-based hash function, the chaotic neural network-based hash function, the parallel hash function as well as the combined chaotic cryptographic and hashing scheme. Meanwhile, the detailed analyses of some typical chaos-based hash functions are described. Finally, by borrowing some principles from classical Cryptography, we summarize some instructions on chaos-based hash function secure construction which is beneficial to the hash function design based on chaos in the future.

show abstract

“…Hash function is a fundamental building block of information security and plays an important role in integrity protection, message authentication [1] and digital signature [2]. It is a one-way and compression function that maps an arbitrary length message to a fixed length value.…”

Section: Introductionmentioning

confidence: 99%

A novel Hash algorithm construction based on chaotic neural network

Deng

Xiao

2010

Neural Comput & Applic

118

View full text Add to dashboard Cite

An algorithm for constructing a one-way novel Hash function based on two-layer chaotic neural network structure is proposed. The piecewise linear chaotic map (PWLCM) is utilized as transfer function, and the 4-dimensional and one-way coupled map lattices (4D OWCML) is employed as key generator of the chaotic neural network. Theoretical analysis and computer simulation indicate that the proposed algorithm presents several interesting features, such as high message and key sensitivity, good statistical properties, collision resistance and secure against meet-inthe-middle attacks, which can satisfy the performance requirements of Hash function.

show abstract

A Chaos-Based Cryptographic Hash Function for Message Authentication

Cited by 38 publications

References 2 publications

A novel parallel hash function based on 3D chaotic map

A novel parallel hash function based on 3D chaotic map

Chaos Based Hash Function

A novel Hash algorithm construction based on chaotic neural network

Contact Info

Product

Resources

About