A novel image encryption algorithm using AES and visual cryptography
01 Oct 2016-Vol. 2016, pp 808-813
TL;DR: A secure image encryption algorithm that uses both AES and Visual Cryptographic techniques to protect the image is proposed and an encoding schema has been proposed to convert the key into shares based on Visual Secret Sharing.
Abstract: With the current emergence of the Internet, there is a need to securely transfer images between systems. In this context, we propose a secure image encryption algorithm that uses both AES and Visual Cryptographic techniques to protect the image. The image is encrypted using AES and an encoding schema has been proposed to convert the key into shares based on Visual Secret Sharing. The cryptanalysis of the algorithm is then performed and is proved to be secure. The proposed algorithm is then implemented using python and the results are discussed along with the possible future modifications.
Citations
More filters
TL;DR: A survey on the most up-to-date chaos-based image encryption techniques and classifies them into spatial, temporal and spatio-temporal domains for better understanding is presented in this paper .
Abstract: Abstract Chaos-based cryptosystems have been an active area of research in recent years. Although these algorithms are not standardized like AES, DES, RSA, etc., chaos-based cryptosystems like Chebyshev polynomials can provide additional security when used with standard public key cryptosystems like RSA and El-gamal. Standard encryption algorithms such as AES have always been the primary choice, but when it comes to image or video encryption, many researchers recommend chaos-based encryption techniques due to their computational efficiency. This paper presents a survey on the most up-to-date chaos-based image encryption techniques and classifies them into spatial, temporal and spatiotemporal domains for better understanding. The significant improvements in the field of image encryption are discussed. In addition, comparative analysis is performed to validate the evaluation matrices for quantifying the encryption algorithms’ security and performance in recent papers.
33 citations
TL;DR: A survey on the most up-to-date chaos-based image encryption techniques and classifies them into spatial, temporal and spatio-temporal domains for better understanding is presented in this article .
Abstract: Abstract Chaos-based cryptosystems have been an active area of research in recent years. Although these algorithms are not standardized like AES, DES, RSA, etc., chaos-based cryptosystems like Chebyshev polynomials can provide additional security when used with standard public key cryptosystems like RSA and El-gamal. Standard encryption algorithms such as AES have always been the primary choice, but when it comes to image or video encryption, many researchers recommend chaos-based encryption techniques due to their computational efficiency. This paper presents a survey on the most up-to-date chaos-based image encryption techniques and classifies them into spatial, temporal and spatiotemporal domains for better understanding. The significant improvements in the field of image encryption are discussed. In addition, comparative analysis is performed to validate the evaluation matrices for quantifying the encryption algorithms’ security and performance in recent papers.
19 citations
01 Jan 2021
TL;DR: This chapter enforces identifying methods in digital steganography, and only data hiding in text is discussed.
Abstract: In this digital era, most of the daily works of users are captured in digital forms like image, audio, video, or even text. These may contain sensitive, confidential, or private information as well. To keep these, there are different techniques exercised over the years like chest, coffer, repository, treasury, etc. Sometimes such ways of hiding information attract unintended users. Therefore, steganography has been applied to digital objects in a new form called digital steganography. This chapter enforces identifying methods in digital steganography. The basic model of any type of digital steganography is composed of three types of objects: cover object, text to be hidden, and stego object. Depending on the type of cover object, different types of digital steganography methods have been defined. Only data hiding in text is discussed.
7 citations
01 Jan 2021
TL;DR: This chapter proposes an innovative image encryption method that is quicker than the current researches and embedded in the ciphered image using the LSB technique.
Abstract: In the information technology community, communication is a vital issue. And image transfer creates a major role in the communication of data through various insecure channels. Security concerns may forestall the direct sharing of information and how these different gatherings cooperatively direct data mining without penetrating information security presents a challenge. Cryptography includes changing over a message text into an unintelligible figure and steganography inserts message into a spread media and shroud its reality. Both these plans are successfully actualized in images. To facilitate a safer transfer of image, many cryptosystems have been proposed for the image encryption scheme. This chapter proposes an innovative image encryption method that is quicker than the current researches. The secret key is encrypted using an asymmetric cryptographic algorithm and it is embedded in the ciphered image using the LSB technique. Statistical analysis of the proposed approach shows that the researcher's approach is faster and has optimal accuracy.
6 citations
TL;DR: The proposed cryptosystem uses a modified k-shuffling technique to scramble pixels of images and further decomposes them using Residue Number System and shows resistance to statistical attacks and a significant reduction in the size of cipher images which enhances the speed of transmission over network.
Abstract: This paper proposes an algorithm that enhances the speed of transmission and secure images that are transmitted over internet or a network. The proposed cryptosystem uses a modified k-shuffling technique to scramble pixels of images and further decomposes them using Residue Number System. Simulations are done using two moduli sets with the modified k-shuffle technique. Analyses of results showed that both simulations could secure images without any loss of information and also the time taken for a complete encryption/decryption process is dependent on the moduli set. Among the chosen moduli sets, the even moduli set optimizes and completes execution using less time as compared to the traditional moduli set. The proposed scheme also showed resistance to statistical attacks (histogram, ciphertext, correlation attacks) and a significant reduction in the size of cipher images which enhances the speed of transmission over network.
5 citations
References
More filters
04 Dec 2011
TL;DR: The notion of Built-in Tamper Resilience (BiTR) was introduced in this paper for cryptographic protocols, capturing the idea that the protocol that is encapsulated in a hardware token is designed in such a way so that tampering gives no advantage to an adversary.
Abstract: The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests them as an alternative to other setup assumptions, towards achieving general UC-secure multi-party computation. On the other hand, a lot of recent research has focused on protecting security of various cryptographic primitives against physical attacks such as leakage and tampering.
In this paper we put forward the notion of Built-in Tamper Resilience (BiTR) for cryptographic protocols, capturing the idea that the protocol that is encapsulated in a hardware token is designed in such a way so that tampering gives no advantage to an adversary. Our definition is within the UC model, and can be viewed as unifying and extending several prior related works. We provide a composition theorem for BiTR security of protocols, impossibility results, as well as several BiTR constructions for specific cryptographic protocols or tampering function classes. In particular, we achieve general UC-secure computation based on a hardware token that may be susceptible to affine tampering attacks. We also prove that two existing identification and signature schemes (by Schnorr and Okamoto, respecitively) are already BiTR against affine attacks (without requiring any modification or endcoding). We next observe that non-malleable codes can be used as state encodings to achieve the BiTR property, and show new positive results for deterministic non-malleable encodings for various classes of tampering functions.
664 citations
TL;DR: A stream-cipher algorithm based on one-time keys and robust chaotic maps, in order to get high security and improve the dynamical degradation, and is suitable for application in color image encryption.
Abstract: We designed a stream-cipher algorithm based on one-time keys and robust chaotic maps, in order to get high security and improve the dynamical degradation. We utilized the piecewise linear chaotic map as the generator of a pseudo-random key stream sequence. The initial conditions were generated by the true random number generators, the MD5 of the mouse positions. We applied the algorithm to encrypt the color image, and got the satisfactory level security by two measures: NPCR and UACI. When the collision of MD5 had been found, we combined the algorithm with the traditional cycle encryption to ensure higher security. The ciphered image is robust against noise, and makes known attack unfeasible. It is suitable for application in color image encryption.
490 citations
"A novel image encryption algorithm ..." refers methods in this paper
...Many image encryption algorithms have been proposed using chaotic maps [18] [19] [20]....
[...]
01 Aug 1987
TL;DR: In this article, the authors present an in-depth introduction to chaos in dynamical systems, and present several practical techniques for recognizing and classifying chaotic behavior, such as poincare map, Lyapunov exponents, capacity, information dimension, correlation dimension, and the reconstruction of attractors from a single time series.
Abstract: This tutorial presents an in-depth introduction to chaos in dynamical systems, and presents several practical techniques for recognizing and classifying chaotic behavior. These techniques include the poincare map, Lyapunov exponents, capacity, information dimension, correlation dimension, Lyapunov dimension, and the reconstruction of attractors from a single time series.
418 citations
"A novel image encryption algorithm ..." refers background in this paper
...Chaos theory, one of the studies in Mathematics is mainly involved in analyzing and predicting the behavior of dynamic systems that are highly changeable with respect to initial conditions [15] [16]....
[...]
TL;DR: Two general k out of n constructions that are related to those of maximum size arcs or MDS codes and the notion of coloured visual secret sharing schemes is introduced and a general construction is given.
Abstract: The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described.
Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.
349 citations
"A novel image encryption algorithm ..." refers background in this paper
...After few years, Verheul and Tilborg [7] developed a systematic approach that can be applied on colored images....
[...]
01 Jan 2015
TL;DR: This work proposes a new image encryption algorithm which is based on the spatiotemporal non-adjacent coupled map lattices, which has more outstanding cryptography features in dynamics than the logistic map or coupledmap lattices does.
Abstract: We propose an image encryption scheme based on a new spatiotemporal chaotic system.The encryption scheme is not the one time pad encryption.The proposed image encryption has a large key space and high security. We propose a new image encryption algorithm which is based on the spatiotemporal non-adjacent coupled map lattices. The system of non-adjacent coupled map lattices has more outstanding cryptography features in dynamics than the logistic map or coupled map lattices does. In the proposed image encryption, we employ a bit-level pixel permutation strategy which enables bit planes of pixels permute mutually without any extra storage space. Simulations have been carried out and the results demonstrate the superior security and high efficiency of the proposed algorithm.
330 citations
"A novel image encryption algorithm ..." refers methods in this paper
...Many image encryption algorithms have been proposed using chaotic maps [18] [19] [20]....
[...]