A novel algorithm for image encryption based on mixture of chaotic maps

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

“…We used its conjugate or isomorphic map [39,41]. Conjugacy means that the invertible map h(x) = [39,42].…”

Section: High Dimensional Chaotic Mapmentioning

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

“…An optimized treatment and a cross-sampling disposal are introduced for enhancing the irregular and pseudorandom characteristics of chaotic sequences [4]. Behnia et al [6] present a novel algorithm for image encryption based on the mixture of chaotic maps. In their algorithm, a typical coupled map was mixed with a 1D chaotic map and used for high degree security image encryption while its speed is acceptable.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Using Random Bit Sequence Based on Chaotic Maps

2013

View full text Add to dashboard Cite

The paper proposes an algorithm for image encryption using the random bit sequence generator and based on chaotic maps. Chaotic Logistic and Tent maps are used to generate required random bit sequences. Pixels of the plain image are permuted using these chaotic functions, and then the image is partitioned into eight bit map planes. In each plane, bits are permuted and substituted according to random bit and random number matrices; these matrices are the products of those functions. The pixels and bit maps permutation stage are based on a chaotic random Ergodic matrix. This chaotic encryption method produces encrypted image whose performance is evaluated using chi-square test, correlation coefficient, number of pixel of change rate (NPCR), unified average changing intensity (UACI), and key space. The histogram of encrypted image is approximated by a uniform distribution with low chi-square factor. Horizontal, vertical, and diagonal correlation coefficients of two adjacent pixels of encrypted image are calculated. These factors are improved compared to other proposed methods. The NPCR and UACI values of encrypted image are also calculated. The result shows that a swift change in the original image will cause a significant change in the ciphered image. Total key space for the proposed method is (2 ∧ 2,160), which is large enough to protect the proposed encryption image against any bruteforce attack.

show abstract

“…However, a simple chaos system also has many defects; for example, the implementation of the chaos on a computer is affected by the limited precision; the time series outputted by the simple chaotic system generally cannot reach the theoretically complete random, resulting in the problem that the pseudorandom sequence appears periodicity [10].…”

Section: Mathematical Problems In Engineeringmentioning

confidence: 99%

Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization

Tian

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

As the unique nonlinear component of block ciphers, Substitution box (S-box) directly affects the safety of a cryptographic system. It is important and difficult to design strong S-box that simultaneously meets multiple cryptographic criteria such as bijection, nonlinearity, strict avalanche criterion (SAC), bit independence criterion (BIC), differential probability (DP), and linear probability (LP). Though many chaotic S-boxes have been proposed, the cryptographic performance of most of them needs to be further improved. A new chaotic S-box based on the intertwining logistic map and bacterial foraging optimization is designed in this paper. It firstly iterates the intertwining logistic map to construct many S-boxes and then applies a bacterial foraging optimization algorithm to find the optimal S-box. Moreover, bacterial foraging optimization algorithm considers the nonlinearity and differential uniformity as the fitness functions in the optimization process. We experiment that the proposed S-box can effectively resist multiple types of cryptanalysis attacks.

show abstract

A novel algorithm for image encryption based on mixture of chaotic maps

Cited by 381 publications

References 29 publications

A novel parallel hash function based on 3D chaotic map

A novel parallel hash function based on 3D chaotic map

Image Encryption Using Random Bit Sequence Based on Chaotic Maps

Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization

Contact Info

Product

Resources

About