Double Random Phase Encryption Based Orthogonal Encoding Technique for Color Images
In-Ho Lee,Myungjin Cho +1 more
TL;DR: The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity, and consists of simple linear operations, so that it is easy to implement.
read more
Abstract: In this paper, we propose a simple Double random phase encryption (DRPE)-based orthogonal encoding technique for color image encryption. In the proposed orthogonal encoding technique, a color image is decomposed into red, green, and blue components before encryption, and the three components are independently encrypted with DRPE using the same key in order to decrease the complexity of encryption and decryption. Then, the encrypted data are encoded with a Hadamard matrix that has the orthogonal property. The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity. The proposed orthogonal encoder consists of simple linear operations, so that it is easy to implement. We also provide the simulation results in order to show the effects of the proposed orthogonal encoding technique.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multiple-parameter fractional quaternion Fourier transform and its application in colour image encryption
TL;DR: The proposed MPFrQFT-based encryption algorithm has an overall better performance than eight compared algorithms in security test and robustness test: it is more secure than theCompared frequency-based algorithms due to the larger key space and the more sensitive key `transform orders'; it is also more robust than the compared spatial-domain algorithms.
44
A cryptosystem based on deterministic phase masks and fractional Fourier transform deploying singular value decomposition
R. Girija,Hukum Singh +1 more
TL;DR: In this paper, an asymmetric cryptosystem has been proposed to enhance the security of DRPE scheme by using fractional Fourier transform (FrFT), a class of structured phase masks called as deterministic phase masks (DMKs) and deploying singular value decomposition (SVD).
42
Double Random Phase Encryption using Orthogonal Encoding for Multiple-Image Transmission
In-Ho Lee,Myungjin Cho +1 more
TL;DR: Simulation results verify that the DR PE using orthogonal encoding for multiple images is more secure than both the conventional DRPE and the DRPE using orthogenetic encoding for a single image.
Image Authentication Using Only Partial Phase Information from a Double-Random-Phase-Encrypted Image in the Fresnel Domain
Jiecai Zheng,Xueqing Li +1 more
TL;DR: This paper presents an image-authentication method which uses only partial phase information from a double-random-phase-encrypted image in the Fresnel domain and demonstrates that the encrypted images can be successfully authenticated with this partial phase plus nonlinear correlation technique.
Color image encryption based on discrete trinion Fourier transform and random-multiresolution singular value decomposition
TL;DR: The quality of the retrieved image is better than that of the algorithm based on single color channel processing separately and quaternion matrix based algorithms when it is decrypted correctly or under Gaussian noise and shear attacks.
11
References
Optical image encryption based on input plane and Fourier plane random encoding.
Philippe Réfrégier,Bahram Javidi +1 more
TL;DR: A new optical encoding method of images for security applications is proposed and it is shown that the encoding converts the input signal to stationary white noise and that the reconstruction method is robust.
2.6K
Reducing elliptic curve logarithms to logarithms in a finite field
TL;DR: The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logarathm problem in the multiplicative group of an extension of the underlying finite field, thus providing a probabilistic subexponential time algorithm for the former problem.
1.3K
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Charles Rackoff,Daniel R. Simon +1 more
- 11 Aug 1991
TL;DR: A formalization of chosen ciphertext attack is given in the model which is stronger than the "lunchtime attack" considered by Naor and Yung, and it is proved a non-interactive public-key cryptosystem based on non-Interactive zero-knowledge proof of knowledge to be secure against it.
LX. Thoughts on inverse orthogonal matrices, simultaneous signsuccessions, and tessellated pavements in two or more colours, with applications to Newton's rule, ornamental tile-work, and the theory of numbers
TL;DR: The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science: Vol. 34, No. 232, pp. 461-475 as discussed by the authors, with applications to Newton's rule, ornamental tile-work, and the theory of numbers.
391
An ID-based cryptosystem based on the discrete logarithm problem
Shigeo Tsujii,T. Itoh +1 more
TL;DR: An ID-based cryptosystem based on the discrete logarithm problem is proposed which is one of the earliest realizations in Shamir's sense and the security against a conspiracy of some entities in the proposed system is considered, along with the possibility of establishing a more secure system.
207