Image encryption in the fractional-order domain

Radwan, Ahmed G.; Abd-El-Hafiz, Salwa K.; AbdElHaleem, Sherif H.

doi:10.1109/icengtechnol.2012.6396148

Cited by 34 publications

(22 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The selected bits for confusion should be highly chaotic and in the range from 0 to 255 as in (2). Let X, Y and Z be the outputs from Lorenz system, then…”

Section: A Confusion Processmentioning

confidence: 99%

“…Block cipher encryption techniques usually include two confusion and diffusion stages and many of them depend on chaotic generators [1]. Recently, considerable research has been performed to increase the complexity of the confusion process using fractional-order chaotic systems [2], new Pseudo Random Number Generators (PRNG) based on fractal shapes [3], or generalized Feistel networks [4,5]. On the other hand, the diffusion process can be implemented using chaotic generators, discrete maps along with several chaotic systems, or chaotic generators along with S-Boxes [6][7][8][9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A chess-based chaotic block cipher

Abdeihaleem

Radwan

Abd-El-Hafiz

2014

2014 IEEE 12th International New Circuits and Systems Conference (NEWCAS)

Self Cite

View full text Add to dashboard Cite

This paper presents a new and efficient block cipher encryption system, which includes confusion as well as diffusion processes. While the confusion process is based on the Lorenz chaotic generator, the diffusion process is chess-based. By utilizing the chess horse movement rules, the diffusion process increases the encryption complexity and improves the differential attack measures. Furthermore, combining chaotic and chessbased algorithms increases the length of the encryption key and, hence, makes brute force attacks infeasible. The encryption system is analyzed using miscellaneous evaluation criteria such as pixel correlation coefficients, differential attack measures, histograms and the NIST statistical test suite. Key sensitivity analysis is also performed and the mean square error and entropy measures are calculated. In addition, several examples are presented for different block sizes showing promising results.

show abstract

“…The selected bits for confusion should be highly chaotic and in the range from 0 to 255 as in (2). Let X, Y and Z be the outputs from Lorenz system, then…”

Section: A Confusion Processmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A chess-based chaotic block cipher

Abdeihaleem

Radwan

Abd-El-Hafiz

2014

2014 IEEE 12th International New Circuits and Systems Conference (NEWCAS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since then, many image encryption algorithms have been developed based on chaotic systems [2]- [4] . Since the last few years, fractional order extensions of the chaotic systems have become quite popular choice over the integer order versions because they provide much larger key-spaces [5], [6]. In the present work, we propose and demonstrate a scheme, in which multiple chaotic systems are combined to accomplish the algorithm.…”

Section: Introductionmentioning

confidence: 99%

Colour image encryption based on multiple fractional order chaotic systems

Dasgupta

Paral

Bhattacharya

2014

Proceedings of the 2014 International Conference on Control, Instrumentation, Energy and Communication (CIEC)

View full text Add to dashboard Cite

This paper demonstrates a colour image encryption algorithm that incorporates multiple fractional order chaotic systems. Here, the fractional order extensions of four well known chaotic systems are tactfully combined together to generate the cyphering key. The encrypted image shows uniform histogram, zero autocorrelation and very high entropy for all the three colour-channels. Moreover, the algorithm possesses an extremely huge key-space. Thus, the algorithm becomes invulnerable against brute-force attacks. However, due to the fact that the fractional order derivatives are not 'local operations' like their integer order counterparts, solving fractional order differential equations become a difficult and time consuming task for computers. To overcome this, some efficient computing techniques have been adopted to run the encryption-decryption process reasonably fast.

show abstract

“…Different chaotic properties such as sensitive dependence on initial conditions and system parameters, pseudorandom property, non-periodicity and topological transitivity moti vate the scholars and researchers to set their eyes on the works involving chaotic encryption. Lately, fractional order extensions of some well known chaotic attractors have been developed and used for the purpose of encryption [6], [7]. These fractional order chaotic systems are known to provide a larger and more sensitive key space due to the fact that the dynamics of fractional order chaotic systems are not dependent only on the initial conditions but also on the derivative orders.…”

Section: Introductionmentioning

confidence: 99%

Colour image encryption based on cross-coupled chaotic map and fractional order chaotic systems

Paral

Dasgupta

Bhattacharya

2014

2014 International Conference on Communication and Signal Processing

View full text Add to dashboard Cite

This paper presents a colour image encryption algorithm based on cross-coupled chaotic map and fractional order chaotic systems. Firstly the algorithm employs the cross coupled chaotic skew tent map to perform the shuffling operation, and then uses the fractional order versions of Lorenz's system and Chen's system to disturb image pixel intensity values. Fractional order extensions of the chaotic systems provides a much larger key-space than their original integer order versions. The encrypted image exhibits uniform histogram and a very high entropy for all the three colour channels. Also, the property of zero correlation is satisfied by the intensity values of adjacent pixels in each channel of the encrypted image. Moreover, the algorithm possesses a key-space which is large enough to resist all possible kinds of statistical attacks. Theoretical analysis and experimental results thus demonstrate that the proposed scheme has an excellent efficiency and satisfactory security attributes.However, solving fractional order differential equations is a com putationally heavy process. Some efficient computing techniques are successfully employed to deal with this problem, so that the encryption-decryption process is executed reasonably fast.

show abstract

Image encryption in the fractional-order domain

Cited by 34 publications

References 18 publications

A chess-based chaotic block cipher

A chess-based chaotic block cipher

Colour image encryption based on multiple fractional order chaotic systems

Colour image encryption based on cross-coupled chaotic map and fractional order chaotic systems

Contact Info

Product

Resources

About