Modified Chaotic Key-Based Algorithm for Image Encryption and its VLSI Realization

Rao, K. Deergha; Gangadhar, Ch.

doi:10.1109/icdsp.2007.4288613

Cited by 22 publications

(11 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The modulo addition then XORing operation, which is nonlinear and has low computational complexity, serves as the fundamental or even the only component in many image cryptosystems [2,14,15,16,17,4]. Mathematically, it can be expressed as…”

Section: Related Work and Main Resultsmentioning

confidence: 99%

Chosen-plaintext attack of an image encryption scheme based on modified permutation–diffusion structure

et al. 2016

View full text Add to dashboard Cite

Since the first appearance in Fridrich's design, the usage of permutation-diffusion structure for designing digital image cryptosystem has been receiving increasing research attention in the field of chaos-based cryptography. Recently, a novel chaotic Image Cipher using one round Modified Permutation-Diffusion pattern (ICMPD) was proposed. Unlike traditional permutation-diffusion structure, the permutation is operated on bit level instead of pixel level and the diffusion is operated on masked pixels, which are obtained by carrying out the classical affine cipher, instead of plain pixels in ICMPD. Following a divide-and-conquer strategy, this paper reports that ICMPD can be compromised by a chosen-plaintext attack efficiently and the involved data complexity is linear to the size of the plain-image. Moreover, the relationship between the cryptographic kernel at the diffusion stage of ICMPD and modulo addition then XORing is explored thoroughly.

show abstract

Section: Related Work and Main Resultsmentioning

confidence: 99%

Chosen-plaintext attack of an image encryption scheme based on modified permutation–diffusion structure

et al. 2016

View full text Add to dashboard Cite

show abstract

“…These methods generate infinite cryptographic key streams to encrypt one bit or one byte in one slot. Different chaotic papers [8] [9] were used this method for image encryption. [10] Jui-Cheng and Jiun-In Guo proposed image encryption decryption algorithm in which gray level of each pixel is XORed or XNORed bit-by-bit to one of the two predetermined keys.…”

Section: Stream Encryptionmentioning

confidence: 99%

A Technique for Image Encryption with Combination of Pixel Rearrangement Scheme Based On Sorting Group-Wise Of RGB Values and Explosive Inter-Pixel Displacement

Goel¹,

Chandra²

2012

IJIGSP

View full text Add to dashboard Cite

-Encryption is used to prevent data from unauthorized access and with the appalling headway in network technology seen in the past decade; it has become the need of time to encrypt the images before sending over open network. Though researchers has proposed contrastive methods to encrypt images but correlation between pixels RGB value play a imperative part to guess for original image. So, here we introduce a new image encryption method which first rearranges the pixels within image on basis of RGB values and then forward intervening image for encryption. Experimentally it has shown that pixel rearrangement is enough from image encryption point of view but to send image over open network; inter-pixel displacement algorithm is applied to dispense more armament to image before transmission.

show abstract

“…where ⊕ stands for bitwise exclusive or. Many other works adopt similar (or even the same) diffusion mechanisms, see [23,24,17,16,25,14,15,26,27,28] for examples. It is not surprising that the computational efficient modulo multiplication can also be incorporated into the diffusion stage [23,29].…”

Section: Introductionmentioning

confidence: 99%

“…It is further reduced to 2 pairs of chosen (α, β) in [39]. As far as we know, these works must be considered as independent analyses of particular image ciphers [26,25]. In our previous work [41], it was reported that the diffusion mechanism suggested by Chen et al [11] can be cast to the form (α ∔ k) ⊕ (β ∔ k) = y under CP attack and the similar method can be also used to analyze other DEA that includes modulo multiplication operation.…”

Section: Introductionmentioning

confidence: 99%

“…First, we analyze the relationship between a class of popular diffusion mechanisms and the DEA (α ∔ k) ⊕ (β ∔ k) = y by studying three example image ciphers [14,15,16]. It is also worth mentioning that the similar DEA can be found in many other designs [23,24,17,16,25,14,15,26,27,28] so the application of our analyses is not limited to the three case studies. Second, we analytically investigate the sufficient condition to solve (α ∔ k) ⊕ (β ∔ k) = y and we also experimentally present a simple KP attack to a variant of this DEA.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Security of a Class of Diffusion Mechanisms for Image Encryption

Zhang

Liu

Pareschi

et al. 2018

IEEE Trans. Cybern.

104

View full text Add to dashboard Cite

The need for fast and strong image cryptosystems motivates researchers to develop new techniques to apply traditional cryptographic primitives in order to exploit the intrinsic features of digital images. One of the most popular and mature technique is the use of complex dynamic phenomena, including chaotic orbits and quantum walks, to generate the required key stream. In this paper, under the assumption of plaintext attacks we investigate the security of a classic diffusion mechanism (and of its variants) used as the core cryptographic primitive in some image cryptosystems based on the aforementioned complex dynamic phenomena. We have theoretically found that regardless of the key schedule process, the data complexity for recovering each element of the equivalent secret key from these diffusion mechanisms is only O(1). The proposed analysis is validated by means of numerical examples. Some additional cryptographic applications of our work are also discussed.

show abstract

Modified Chaotic Key-Based Algorithm for Image Encryption and its VLSI Realization

Cited by 22 publications

References 3 publications

Chosen-plaintext attack of an image encryption scheme based on modified permutation–diffusion structure

Chosen-plaintext attack of an image encryption scheme based on modified permutation–diffusion structure

A Technique for Image Encryption with Combination of Pixel Rearrangement Scheme Based On Sorting Group-Wise Of RGB Values and Explosive Inter-Pixel Displacement

On the Security of a Class of Diffusion Mechanisms for Image Encryption

Contact Info

Product

Resources

About