Abstract

This paper describes a plaintext related image encryption algorithm that utilizes the Mojette transform for computation of bins that are subsequently combined with pixels of the processed image. While the bins are computed solely from pixel intensities of a plain image and also the combination depends only on intensities of plain image pixels, the parameters of bins are rearranged according to used key. This design results in a great sensitivity of the proposed image encryption algorithm to both plain images and keys, which is verified by a set of experiments. The paper also tests the resistance of the proposal against statistical and differential attacks by means of commonly used measures as correlation coefficients, entropy, NPCR and UACI. Furthermore, the paper analyses computation speed reached by the proposed solution. Computed values of all parameters are discussed and then compared with results obtained by some recent plaintext related image encryption algorithms.

Keywords

MSC

94A60, 68U10

Cite this article

@article{cai-4547,
  author  = {Ľuboš Ovseník and Ján Turán and Tomáš Huszaník and Jakub Oravec and Ondrej Kováč and Milan Oravec},
  title   = {Image Encryption Algorithm with Plaintext Related Chaining},
  journal = {Computing and Informatics},
  volume  = {38},
  number  = {3},
  pages   = {647--678},
  year    = {2019},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2019_3_647}
}
Download .bib