A fast chaotic block cipher for image encryption

•Encryption keys generation from the solutions of Linear Diophantine Equation.•LDE coefficients are integers and dynamically generated from a chaotic system.•Dynamical updating of the permutation and diffusion keys.•A secure and fast encryption method compared to the two round encryption scheme. Ima...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications in nonlinear science & numerical simulation 2014-03, Vol.19 (3), p.578-588
Hauptverfasser: Armand Eyebe Fouda, J.S., Yves Effa, J., Sabat, Samrat L., Ali, Maaruf
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Encryption keys generation from the solutions of Linear Diophantine Equation.•LDE coefficients are integers and dynamically generated from a chaotic system.•Dynamical updating of the permutation and diffusion keys.•A secure and fast encryption method compared to the two round encryption scheme. Image encryption schemes based on chaos usually involve real number arithmetic operations to generate the chaotic orbits from the chaotic system. These operations are time-consuming and are normally performed with high-end processors. To overcome this drawback, this paper proposes a one round encryption scheme for the fast generation of large permutation and diffusion keys based on the sorting of the solutions of the Linear Diophantine Equation (LDE) whose coefficients are integers and dynamically generated from any type of chaotic systems. The high security and low computational complexity are achieved not only by using large permutation based on the sorting of the solutions of LDE but also by generating only one permutation from the sorting of the solutions of the LDE, then by dynamically updating d number of integers (d>2) in the permutation. The performance of the proposed scheme is evaluated using various types of analysis such as entropy analysis, difference analysis, statistical analysis, key sensitivity analysis, key space analysis and speed analysis. The experimental results indicate that the proposed algorithm is secure and fast as compared to the two round encryption scheme.
ISSN:1007-5704
1878-7274
DOI:10.1016/j.cnsns.2013.07.016