Image Encryption Algorithm with Plaintext Related Chaining

Ovseník, Ľuboš; Turán, Ján; Huszaník, Tomáš; Oravec, Jakub; Kováč, Ondrej; Oravec, Milan

doi:10.31577/cai_2019_3_647

Cited by 8 publications

(21 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where S is a number of the most significant iterate decimal places that are going to be discarded during the quantisation and a (mod b) returns remainder after dividing a by b. Usual values of S are 4 or 5 decimal places which ensure almost uniform distribution of iterate values [20,25]. Higher values of S may result in unnecessary increase of computational complexity.…”

Section: Quantisation Approachesmentioning

confidence: 99%

“…Higher values of S may result in unnecessary increase of computational complexity. In most implementations, the iterate values are double precision data type which enables exact representation of real numbers up to 15 decimal places [20]. The effects of decimal place removal during quantisation are illustrated in Figure 4.…”

Section: Quantisation Approachesmentioning

confidence: 99%

“…The encryption times t enc and decryption times t dec do not take parameters of used image as resolution or colour depth into consideration. Therefore, encryption speed v enc and decryption speed v dec are computed from t enc or t dec via (20):…”

Section: Measurement Of Computational Complexitymentioning

confidence: 99%

“…where h, w and num cp stand for image height, width and number of its colour planes, a constant of 2 20 represents number of bytes in a megabyte and t oper is a time necessary either for one encryption (t enc ) or one decryption (t dec ). The t oper is measured in seconds.…”

Section: Measurement Of Computational Complexitymentioning

confidence: 99%

See 3 more Smart Citations

An image encryption algorithm with a plaintext‐related quantisation scheme

Oravec

Ovseník

Papaj

2021

IET Image Processing

Self Cite

View full text Add to dashboard Cite

This paper describes an image encryption algorithm that utilises a plaintext-related quantisation scheme. Various plaintext-related approaches from other algorithms are presented and their properties are briefly discussed. Main advantage of the proposed solution is the achievement of a similar behaviour like that of more complex approaches with a plaintextrelated technique used in a rather simple step such as quantisation. This design should result in a favourable computational complexity of the whole algorithm. The properties of the proposal are evaluated by a number of commonly used numerical parameters. Also, the statistical properties of a pseudo-random sequence that is quantised according to the plain image pixel intensities are investigated by tests from NIST 800-22 suite. Obtained results are compared to values reported in related works and they imply that the proposed solution produces encrypted images with comparable statistical properties but authors' design is faster and more efficient. 1 INTRODUCTION Development of the first encryption algorithms designed specifically for images dates to the second half of the 1990s [1, 2]. Since the early approaches exploited representation of digital images and perceived image encryption only as a permutation of pixel intensities and a combination with pseudo-random (PR) sequence, they were viewed as a quick and quite effective tool [2]. However, some design flaws were reported since then and the comparison with conventional encryption schemes such as Advanced Encryption Standard (AES) limited the usage of dedicated image encryption algorithms to certain specific applications. These include mainly applications where a change of data type is not possible such as: • encryption of images before embedding by means of image steganography [3, 4], • security improvement for medical images [5] and some biometric systems [6], • performance improvement in some simple biometric systems that do not enable hardware acceleration necessary for more complex encryption schemes [6]. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Section: Quantisation Approachesmentioning

confidence: 99%

Section: Quantisation Approachesmentioning

confidence: 99%

Section: Measurement Of Computational Complexitymentioning

confidence: 99%

Section: Measurement Of Computational Complexitymentioning

confidence: 99%

See 2 more Smart Citations

An image encryption algorithm with a plaintext‐related quantisation scheme

Oravec

Ovseník

Papaj

2021

IET Image Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Symmetric key block-cipher-based or chaotic-map-based image encryption methods, as well as convolution operation-based and hyper-chaos-based encryption, are currently being studied. [22][23][24][25][26][27][28][29][30] Partial image encryption-also known as ''selective image encryption''-is used to protect sensitive information or sensitive information within an image. Partial image encryption includes a method for selective encryption of a specific spatial area [31][32][33][34][35][36] and another method used to encrypt part of an image based on unique attributes such as the frequency of the image.…”

Section: Image Encryptionmentioning

confidence: 99%

Partial image encryption using format-preserving encryption in image processing systems for Internet of things environment

Jang

Lee

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Concomitant with advances in technology, the number of systems and devices that utilize image data has increased. Nowadays, image processing devices incorporated into systems, such as the Internet of things, drones, and closed-circuit television, can collect images of people and automatically share them with networks. Consequently, the threat of invasion of privacy by image leakage has increased exponentially. However, traditional image-security methods, such as privacy masking and image encryption, have several disadvantages, including storage space wastage associated with data padding, inability to decode, inability to recognize images without decoding, and exposure of private information after decryption. This article proposes a method for partially encrypting private information in images using FF1 and FF3-1. The proposed method encrypts private information without increasing the data size, solving the problem of wasted storage space. Furthermore, using the proposed method, specific sections of encrypted images can be decrypted and recognized before decryption of the entire information, which addresses the problems besetting traditional privacy masking and image encryption methods. The results of histogram analysis, correlation analysis, number of pixels change rate, unified average change intensity, information entropy analysis, and NIST SP 800-22 verify the security and overall efficacy of the proposed method.

show abstract