Public Key Encryption of Images and Videos in Real Time Using Chebyshev Maps
26 Aug 2008-pp 211-216
TL;DR: A public key encryption based on chebyshev polynomials is described and an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash is proposed.
Abstract: Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials. We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data. We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature. The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.
Citations
More filters
07 Mar 2012
TL;DR: In the recent years, with the development of network and multimedia technology, multimedia data, especially image, audio and video data, is used more and more widely in human society and cryptology has been employed in many practical applications.
Abstract: In the recent years, with the development of network and multimedia technology, multimedia data, especially image, audio and video data, is used more and more widely in human society. Some multimedia data, including entertainment, politics, economics, militaries, industries, education etc, are necessary to be protected by providing confidentiality, integrity, and ownership or identity. In this regard, to protect multimedia contents, cryptology, which appears to be an effective way for information security, has been employed in many practical applications.
35 citations
Cites background from "Public Key Encryption of Images and..."
...Ganesan et al (Ganesan et al., 2008) described a public key encryption (PKVE) of videos based on chaotic maps....
[...]
...The PKVE is secure against known/chosen-plaintext attacks, and has high key sensitivity....
[...]
...In PKVE, if the number of frames is too large, they first use phase scrambling (see Fig.9) (Nishchal et al., 2003) to scramble the video data, and then encrypt the data using chebyshev maps (Bergamo et al., 2005) (see Equation 17)....
[...]
...From Table 3, we get the following conclusions: (1) The CVES, PKVE and LCVS encrypt the video data completely without considering interest regions....
[...]
..., 2002) Y Y Y Y N M N N Y N N PKVE (Ganesan et al., 2008) Y Y Y Y N H N N Y N N LCVS (Kezia & Sudha, 2008) Y N N Y Y M N N Y N N HVOE (Tzouveli et al....
[...]
TL;DR: Two chaos based cryptosystems are proposed: one is the higher-dimensional 12D chaotic map and the other is based on the Ikeda delay differential equation (DDE) suitable for designing a real-time secure symmetric video encryption scheme.
Abstract: Chaos based cryptosystems are an efficient method to deal with improved speed and highly secured multimedia encryption because of its elegant features, such as randomness, mixing, ergodicity, sensitivity to initial conditions and control parameters. In this paper, two chaos based cryptosystems are proposed: one is the higher-dimensional 12D chaotic map and the other is based on the Ikeda delay differential equation (DDE) suitable for designing a real-time secure symmetric video encryption scheme. These encryption schemes employ a substitution box (S-box) to diffuse the relationship between pixels of plain video and cipher video along with the diffusion of current input pixel with the previous cipher pixel, called cipher block chaining (CBC). The proposed method enhances the robustness against statistical, differential and chosen/known plain text attacks. Detailed analysis is carried out in this paper to demonstrate the security and uniqueness of the proposed scheme.
23 citations
Journal Article•
23 Jun 2012-World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering
TL;DR: This paper is a review on the aspects and approaches of design an image cryptosystem and general security analysis methods for encrypted images are mentioned.
Abstract: This paper is a review on the aspects and approaches of design an image cryptosystem. First a general introduction given for cryptography and images encryption and followed by different techniques in image encryption and related works for each technique surveyed. Finally, general security analysis methods for encrypted images are mentioned. Keywords—Image, cryptography, encryption, security, analysis.
20 citations
Cites background from "Public Key Encryption of Images and..."
...[13] to encrypt color images and videos in real time applications....
[...]
...[13] Public Key Encryption Digital Signature...
[...]
01 Jan 2011
TL;DR: Traditional ciphers like DES, IDEA, RSA, RSA and AES are often used for text or binary data, while not suitable for direct video encryption because of the following reasons.
Abstract: In recent years, with the development of network technology and multimedia technology, multimedia data, especially video data, are used more and more widely in human society. Some multimedia data applied in entertainment, politics, economics, militaries, industries or education, etc., are necessary to be protected by providing confidentiality, integrity, and ownership or identity. To protect video contents, cryptology, which appears to be an effective way for information security, has been employed in many practical applications[1][2][3]. However, traditional ciphers like DES [4], IDEA [5], RSA[6] and AES[7], are often used for text or binary data, while not suitable for direct video encryption because of the following reasons.
19 citations
Cites background from "Public Key Encryption of Images and..."
...Among them, some encrypt the raw data completely without considering region-of-interest, [32][33][34][35][36] and some consider the region-of-interest partially or selectively [41][42]....
[...]
...CVES[32] H No No No Yes No Yes No PKE[33] L No No No Yes No Yes No LCS [34] L No No Yes Yes No Yes No FSES[35] H No No No Yes No Yes No...
[...]
...1) The encryption algorithms, CVES, PKE, LCS and FSES, encrypt the video data completely, without considering interest regions....
[...]
...Ganesan et al [33] described a public key encryption (PKE) of images and videos based on chebyshev maps, shown as Eq....
[...]
TL;DR: In this paper, an improved AES (IAES) is proposed to improve diffusion and confusion in ciphered video by eliminating shift-row and sub-byte transformations and replacing them with a mix-row operation.
Abstract: Real-time multimedia applications are increasingly achieving success in the everyday world. Thereby, multimedia information relies on security to protect private life. The Advanced Encryption Standard (AES) has been designed to secure different applications. Yet, some limitations are given, making it inappropriate for secure video storation and transmission. The limitations are the time complexity, the multiple iterations, and the predefined substitution box. Thus, any user can use it to break the encryption. Moreover, the multiple iterations augment the need for CPU usage, and so the overall run time. Hence, it is necessary to modify the AES algorithm to make it more appropriate for securing video frames transmission over insecure channel. In this paper, an Improved AES (IAES) is put forward, which improves both diffusion and confusion in ciphered video. Our work consists in the following two main points: First, we propose to eliminate both shift-row and sub-byte transformations and replace them with a mix-row operation. This task reduces the run time, which presents a significant factor for real-time video transmission. Equally important, we propose to use the henon chaotic map in the key generation procedure, which provides more randomness. The Hash Algorithm SHA-3 is used to generate the initial conditions of the chaotic attractor. The video encryption procedure is verified with success, and the experimental results confirm that the novel algorithm combining chaos and IAES augments the entropy of the ciphered video by 15% and reduces the complexity time for both encryption and decryption compared to the standard one. Security analysis is successfully performed, and the results prove that our suggested technique provides the basics of cryptography with more correctness. The PRNG is tested by NIST 800–22 test suit, which indicates that it is suitable for secure image encryption. It provides a large key space of 2128 which resists the brute-force attack. All in all, the findings confirm that the novel security approach eliminates the limitation of the existing AES and provides a trade-off between speed and safety levels to secure video transmission.
12 citations
References
More filters
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Abstract: Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
14,980 citations
"Public Key Encryption of Images and..." refers background in this paper
...Diffie and Hellman showed for the first time that secret communication was possible without any transfer of a secret key between sender and receiver [6]....
[...]
Book•
01 Jan 1996TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.
13,597 citations
"Public Key Encryption of Images and..." refers background in this paper
...to figure out the approximate value of any pixel with the knowledge of its adjacent pixels. 4.3. Mono bit test [ 9 ]...
[...]
...Image(256x256) 9654 9 ]...
[...]
TL;DR: In this paper, chaos-based cryptography is discussed from a point of view which the author believes is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers.
Abstract: Over the past decade, there has been tremendous interest in studying the behavior of chaotic systems. They are characterized by sensitive dependence on initial conditions, similarity to random behavior, and continuous broad-band power spectrum. Chaos has potential applications in several functional blocks of a digital communication system: compression, encryption and modulation. The possibility for self-synchronization of chaotic oscillations has sparked an avalanche of works on application of chaos in cryptography. In this paper, chaos-based cryptography is discussed from a point of view which the author believes is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers.
803 citations
TL;DR: This paper describes an attack which permits to recover the corresponding plaintext from a given ciphertext and points out that also other primitives, a Diffie-Hellman like key agreement scheme and an authentication scheme, designed along the same lines of the cryptosystem are not secure due to the aforementioned attack.
Abstract: Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper, we study a public-key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis, it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries if the cryptosystem is used for signing messages. Then, we point out that also other primitives, a Diffie-Hellman like key agreement scheme and an authentication scheme, designed along the same lines of the cryptosystem, are not secure due to the aforementioned attack. We close the paper by discussing the issues and the possibilities of constructing public-key cryptosystems on real numbers.
283 citations
"Public Key Encryption of Images and..." refers background or methods in this paper
...For the description of how to calculate r’ one can refer to [2]....
[...]
...We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data [2]....
[...]
25 May 2003
TL;DR: A public-key encryption algorithm based on Chebyshev maps is proposed, which is secure, practical, and can be used for both encryption and digital signature.
Abstract: We propose a public-key encryption algorithm based on Chebyshev maps, which is secure, practical, and can be used for both encryption and digital signature. Software implementation and properties of the algorithm are discussed in detail.
193 citations