An image encrypting algorithm based on 1D and 2D logistic chaotic systems
by Yonghong Zhang; Jiaolian Zhao; Bo Zhang
International Journal of Embedded Systems (IJES), Vol. 15, No. 1, 2022

Abstract: Chaotic map is widely applied to digital image encryption because of its properties, such as initial value sensitivity, pseudo-randomness and ergodicity. An algorithm of image encryption based on two-dimensional (2D) chaotic sequence and one-dimensional (1D) chaotic sequence is presented here. Firstly, the initial values of 2D chaotic sequence and 1D chaotic sequence are generated by using 256 bit long integer secret key. Three logistic matrixes are generated by using these three external secret-key sequences. Secondly, the encryption process uses scrambling and diffusion structures. 2D chaotic sequences are used in both scrambling and diffusion processes. Finally, in order to improve the encryption, chaotic maps show advantages because of enough key space and high-level security. Through several typical numerical experiments, such as analysis effect, 1D chaotic sequence is used to scramble 4 * 4 blocks. The initial conditions generated by the three external secret-key sequences in key space, statistics, key sensitivity, etc. it is shown that the given digital image encryption system has higher security.

Online publication date: Fri, 08-Apr-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com