Parallel hash function construction based on coupled map lattices

Wang, Yong; Wong, Kwok-Wo; Xiao, Di

doi:10.1016/j.cnsns.2010.10.001

Cited by 51 publications

(21 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The absolute difference of two hash values and the theoretical number of ω with different values during N independent experiments which is denoted by W N (ω) is calculated using the following formulas: Figure 4a,b. It seems that the proposed algorithm possesses a stronger collision resistance capability than the algorithms in [12,14,27,44] and can be compared with [45,46]. …”

Section: Collision Testmentioning

confidence: 99%

“…The main goal of this attack is to find two messages with identical hash values with less than 2 n/2 trials (n is the size of hash value) [46,51,55]. In fact, the algorithm is flexible so that the length of the hash value can be tuned.…”

Section: Resistance To Birthday Attackmentioning

confidence: 99%

“…This type of collision attack is usually called pseudo-collision attack. The main goal of this attack is to use the weaknesses in the compression function so that the attacker can find a way to reconstruct a hash value for a different message [45,46]. In the proposed algorithm, the message is processed twice (two different threads), once from the beginning to the end and once from the end to the beginning of the message, so that there would be two medial hash values at the same time for each message block, which with regard to a small change in one or both of the medial values (in here, the control parameters and initial conditions) would lead to a completely different sequence (because of the nature of the proposed high-dimensional chaotic map), so it is almost impossible to find a pattern by changing these values.…”

Section: Pseudo-collision Resistancementioning

confidence: 99%

See 2 more Smart Citations

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: Collision Testmentioning

confidence: 99%

Section: Resistance To Birthday Attackmentioning

confidence: 99%

Section: Pseudo-collision Resistancementioning

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

show abstract

“…This procedure is repeated 10000 times. Table 6 depicts the minimum, maximum and mean values of d. It can be seen that the average absolute difference of each character of the proposed hashing scheme is close to the ideal value of 85.43 [20]. This means that the proposed hashing scheme has the stronger collision resistance than the well-known approaches such as MD5 and SHA-1, and the other chaos-based approaches in [17,18,19,21,22].…”

Section: Collision Analysis 1) Collision Testmentioning

confidence: 80%

A Robust Hash Function Using Cross-Coupled Chaotic Maps with Absolute-Valued Sinusoidal Nonlinearity

San-Um¹,

Srichavengsup²

2016

ijacsa

View full text Add to dashboard Cite

show abstract

“…The authors claimed that the algorithm structure ensured the uniform sensitivity of the hash value to the message blocks at different positions. Although this claim has been disputed later on by several researchers, but their basic model has found validation in some other popular schemes [38].…”

Section: Additional Forms Of Neural Cryptographymentioning

confidence: 99%

Neural synchronization based secret key exchange over public channels: A survey

Chakraborty¹,

Dalal²,

Sarkar³

et al. 2014

2014 International Conference on Signal Propagation and Computer Technology (ICSPCT 2014)

View full text Add to dashboard Cite

Abstract-Exchange of secret keys over public channels based on neural synchronization using a variety of learning rules offer an appealing alternative to number theory based cryptography algorithms. Though several forms of attacks are possible on this neural protocol e.g. geometric, genetic and majority attacks, our survey finds that deterministic algorithms that synchronize with the end-point networks have high time complexity, while probabilistic and population-based algorithms have demonstrated ability to decode the key during its exchange over the public channels. Our survey also discusses queries, heuristics, erroneous information, group key exchange, synaptic depths, etc, that have been proposed to increase the time complexity of algorithmic interception or decoding of the key during exchange. The Tree Parity Machine and its variants, neural networks with tree topologies incorporating parity checking of state bits, appear to be one of the most secure and stable models of the end-point networks. Our survey also mentions some noteworthy studies on neural networks applied to other necessary aspects of cryptography. We conclude that discovery of neural architectures with very high synchronization speed, and designing the encoding and entropy of the information exchanged during mutual learning, and design of extremely sensitive chaotic maps for transformation of synchronized states of the networks to chaotic encryption keys, are the primary issues in this field.

show abstract

Parallel hash function construction based on coupled map lattices

Cited by 51 publications

References 20 publications

A novel parallel hash function based on 3D chaotic map

A novel parallel hash function based on 3D chaotic map

A Robust Hash Function Using Cross-Coupled Chaotic Maps with Absolute-Valued Sinusoidal Nonlinearity

Neural synchronization based secret key exchange over public channels: A survey

Contact Info

Product

Resources

About