Applications of tripled chaotic maps in cryptography

Abstract

Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity of the cryptosystem, make a contribution to the development of cryptosystem with higher security. In order to increase the security of the proposed algorithm, the size of key space and the computational complexity of the coupling parameters should be increased as well. Both the theoretical and experimental results state that the proposed algorithm has many capabilities such as acceptable speed and complexity in the algorithm due to the existence of two coupling parameter and high security. Note that the ciphertext has a flat distribution and has the same size as the plaintext. Therefore, it is suitable for practical use in secure communications.Comment: 21 pages, 10 figure

A novel parallel hash function based on 3D chaotic map

“…Due to these properties, chaotic systems have become a very good candidate for use in the field of cryptography. The existing related research progress includes chaos-based symmetric encryptions [1][2][3][4][5][6][7], security protocols [8,9], asymmetric encryptions [10,11], and hash functions [12][13][14][15][16][17][18].…”

“…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]. The high-dimensional chaotic maps [4] possess remarkable dynamical properties such as invariant measure, ergodicity, the possibility of KS-entropy calculation, and bifurcation without any period doubling [4,39,40].…”

“…For instance, an algorithm for image encryption based on a high-dimensional chaotic map with high efficiency is proposed in [4]. The high-dimensional chaotic maps [4] possess remarkable dynamical properties such as invariant measure, ergodicity, the possibility of KS-entropy calculation, and bifurcation without any period doubling [4,39,40].…”

Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity

“…Statistical analysis helps to demonstrate the strength of cryptography algorithms [18] . It is well known that many zero-knowledge proof of identity protocols have been successfully proved and analyzed by using statistical analysis.…”

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

“…With such properties, chaos-based hash algorithms have consequently been of much interest as an alternative to those of typical hash functions. Several chaos-based hash function algorithms have been proposed recently [6][7][8][9]. Despite the fact that these algorithms have offered satisfied statistical performances in terms of statistical performance and collision resistance, the difficulty in small key space, flexibility, low performance, and weak security functions are obstacles that elevate an attempt in designing efficient and secure hash functions.…”