Skip to content
naulon
Not checkedNot checked for notices yet.

Investigation of Chaotic Image Encryption in Spatial and FrFT Domains for Cybersecurity Applications

Osama S. Faragallah, Ashraf Afifi, Walid El-Shafai and 6 more

IEEE Access · 2020

doi:10.1109/access.2020.2974226 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The need for cybersecurity increases to protect the exchange of information for improving the data privacy. This paper presents an investigation of the encryption efficiency of the chaotic-based image block ciphering in the spatial and Fractional Fourier Transform (FrFT) domains. The main aim of this investigation is to examine the efficiency of different chaotic maps, while considering the parameters of the FrFT as additional keys for encryption and achieving reliable cybersecurity for robust image communication. In this paper, Cat, Baker, and Logistic map confusion approaches are applied in the spatial and FrFT domains to study and analyze the cybersecurity and ciphering efficiency of chaos-based image cryptosystems. The confusion features of the chaotic maps in spatial and FrFT domains are investigated using information entropy, differential analysis, histograms, visual observation, attack analysis, impact of noise, and encryption quality tests. Simulation results prove that the chaotic-based image encryption in the FrFT domain increases the efficiency of the confusion process and achieves a high nonlinear relation between the plainimage and the cipherimage in a symmetric ciphering approach. Moreover, the results demonstrate that the Cat-FrFT scheme is more susceptible to channel noise attacks than the Baker-FrFT and the Logistic-FrFT schemes. Hence, they can be implemented efficiently in the scenarios of noisy channels due to their high robustness to channel noise.

Abstract licence: CC BY-NC-ND

References38

    38 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.