2015
DOI: 10.1007/s11071-015-2049-6
|View full text |Cite
|
Sign up to set email alerts
|

Parallel chaotic hash function based on the shuffle-exchange network

Abstract: In recent years, cryptologists have been delving into chaos theory to design more secure cryptographic primitives. However, many existing chaosbased algorithms are slow due to floating point operations. They are mostly sequential in nature and therefore cannot take advantage of multicore processors for faster speed. In this paper, a new chaos-based hash function is proposed that utilizes multiple instances of chaotic maps that run in parallel to improve hashing speed. Parallelization is realized using the base… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 62 publications
(26 citation statements)
references
References 25 publications
0
26
0
Order By: Relevance
“…It also has random behavior, ergodicity, diffusion and confusion characteristics that are analogous to the requirements of cryptographic algorithms. They have been utilized in various areas of cryptography such as encryption algorithms [29][30][31], hash functions [32][33][34][35], key exchange protocols [36][37][38] and many more. These qualities are suitable for the design of a TRNG as any unpredictable behavior will be further amplified, contributing to higher entropy.…”
Section: Chaos Theorymentioning
confidence: 99%
“…It also has random behavior, ergodicity, diffusion and confusion characteristics that are analogous to the requirements of cryptographic algorithms. They have been utilized in various areas of cryptography such as encryption algorithms [29][30][31], hash functions [32][33][34][35], key exchange protocols [36][37][38] and many more. These qualities are suitable for the design of a TRNG as any unpredictable behavior will be further amplified, contributing to higher entropy.…”
Section: Chaos Theorymentioning
confidence: 99%
“…Jiteurtragool et al [34], proposed a topologically simple keyed hash function based on circular chaotic sinusoidal map network that uses more complex map, i.e., the Sine map. In 2014, Teh et al, [35] introduced a parallel chaotic hash function based on the shuffle-exchange network that runs in parallel to improve hashing speed. In 2015, Abdoun et al, [36,37] proposed a new efficient structure that consists of two parts: an efficient chaotic generator and a three or two-layer neural network.…”
Section: Introductionmentioning
confidence: 99%
“…As given in Table 9, the proposed algorithm has a mean changed bit number B = 63.99 and mean changed probability P = 49.99 that are significantly close to the ideal values of 64 bits and 50 %, respectively, which indicate our algorithm has a strong capability for confusion and diffusion. As given in Table 9, the proposed algorithm has ideal values of B and P, and lower standard deviations of B and P, except for Xiao's [20,21,48], Wang's [40], Kanso's [49] and Teh's [50] algorithms. Based on these results, our algorithm shows good statistical performance.…”
Section: Comparison With Other Hash Algorithmsmentioning
confidence: 96%