Attack resistant chaos-based cryptosystem by modified baker map and logistic map
by Debanjan Chatterjee; Barnali Gupta Banik; Abhinandan Banik
International Journal of Information and Computer Security (IJICS), Vol. 20, No. 1/2, 2023

Abstract: In this paper, a new substitution-diffusion type chaos-based cryptosystem is proposed, which can encrypt greyscale images having arbitrary resolution. In substitution, image pixels are permuted using a modified form of the discretised 2-D Baker map, followed by a two-step diffusion approach, which employs a chaotic logistic map. The proposed cryptosystem is resistant to brute force attacks (measured by key-space and key-sensitivity analysis), statistical attacks (tested by histogram and chi-square test) and differential attacks (measured against NPCR, UACI, and hamming distance); the proposed method has also been tested for encryption quality, correlation analysis, entropy analysis, and performance analysis by measuring encryption speed as well as time complexity. Therefore, it is sufficiently secured to be used in real-world applications. To prove the unparalleled outcome of the proposed system, four sets of comparisons have been presented with respect to NPCR and UACI, Encryption throughput, and, lastly, with similar and non-similar existing cryptosystems.

Online publication date: Wed, 04-Jan-2023

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 Information and Computer Security (IJICS):
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