A Contemplator on Topical Image Encryption Measures

A Contemplator on Topical Image Encryption Measures

Jayanta Mondal (KIIT University, India) and Debabala Swain (KIIT University, India)
Copyright: © 2020 |Pages: 18
DOI: 10.4018/978-1-7998-1763-5.ch033
OnDemand PDF Download:
No Current Special Offers


Images unduly assist digital communication in this aeon of multimedia. During times a person transmits confidential images over a flabby communication network, sheer protection is an accost contention to preserve the privacy of images. Encryption is one of the practice to clutch the reticence of images. Image encryption contributes a preeminent bite to charter security for secure sight data communication over the internet. Our work illustrates a survey on image encryption in different domains providing concise exordium to cryptography, moreover, furnishing the review of sundry image encryption techniques.
Chapter Preview


Cryptography is the art or science encompassing the principles and methods of transforming an intelligible message into one that is unintelligible, and then retransforming that message back to its original form.

  • Plaintext: Plaintext is the original intelligible message.

  • Ciphertext: Ciphertext is the transformed message.

  • Encryption: Encryption is the process (algorithm) for transforming a plaintext into a ciphertext.

  • Decryption: Decryption is the reverse process of encryption, i.e. transforming the ciphertext back to plaintext.

  • Key: Key is the most important data used by encryption algorithms, known to the both authorized parties. Encryption mechanisms relies on the key. Encryption algorithms are available for all, so, attacker’s objective is to achieve the key.

Basic cryptography process for a text message at its simplest form can be described as:

Plaintext P=[P1, P2, …, PX] of length X, where X belongs to finite alphabet set. The key K=[K1, K2, …, KY] of length Y. Ciphertext C=[C1, C2, …, CZ] of length Z. With message P and key K the encryption algorithm creates the ciphertext C=EK(P). The plaintext can be achieved by P=DK(C). D being the decryption algorithm.

A cryptosystem thus can be formulated mathematically as a five tuple (P, C, K, E, D) where the following should satisfy:

  • 1.

    P is a finite set of possible plaintext.

  • 2.

    C is a finite set of possible ciphertext.

  • 3.

    K, the key space, is the finite set of possible keys.

  • 4.

    E is encryption rule, and, D is decryption rule.

  • 5.

    kK, ∃ekE, ∃dkD

Complete Chapter List

Search this Book: