Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Optical cryptanalysis of DRPE-based encryption systems

Wan Qin, Wenqi He, Xiangfeng Meng, Xiang Peng

Published Nov 4, 2009• 6 citations
Publisher

Abstract

In this paper, we analyze the security of the classical double random phase encoding (DRPE) technique in Fourier domain, as well as its extended schemes in Fresnel and fractional Fourier domains. These schemes are resistant to bruteforce attacks, for their large key spaces. However, due to the linearity property of their encryption transformations, they are vulnerable to other attacks, such as chosen-plaintext attack and known-plaintext attack. We successfully break each of the three encryption schemes with the help of a certain quantity of plaintext-ciphertext pairs. Each attack is validated by computer simulations. The cryptanalysis indicates that, to minimize the risks, it is recommendable to introduce nonlinear operations to optical encryption systems.

DOI
10.1117/12.839999

Related papers

Vulnerability to known-plaintext attack of optical encryption schemes based on two fractional Fourier transform order keys and double random phase keys

W Qin, Xiang Peng

From the perspective of optical information security, we demonstrate that conventional phase retrieval algorithms, such as the Gerchberg–Saxton algorithm, can be still valid when extended from the Fourier transform domain into the fractional Fourier transform (FRFT) domain. Based on this extension, we propose a method of known-plaintext attack (KPA) on double random phase encoding in the fractional Fourier transform domain (DRPE-FRFT). With this attack, an opponent can access two encryption phase keys with the help of the phase retrieval algorithm in the FRFT domain, and meanwhile obtain the two FRFT order keys by using an exhaustive search. This indicates that the optical encryption scheme based on the DRPE-FRFT scheme is vulnerable to KPA due to the nature of the linearity of FRFT. The validity of this attack is verified by numerical simulations.

Journal of Optics A Pure and Applied Optics•Apr 20, 2009•94 citations

Chosen-plaintext attack on lensless double-random phase encoding in the Fresnel domain

Xiang Peng, Hengzheng Wei, Peng Zhang

We demonstrate a method of chosen-plaintext attack on lensless double-random phase encoding (L-DRPE) in the Fresnel domain. With this attack an opponent can access two encryption keys with help of the impulse functions as chosen plaintexts. This shows that a lensless optical encryption scheme based on DRPE is vulnerable to chosen-plaintext attack. Cryptoanalysis also indicates that the security worry originates from the linearity of the encryption and decryption mechanism of the L-DRPE scheme. One of the interesting features of the proposed attack is that the decryption process is lossless. Numerical simulations show good agreement with theoretical analysis.

Optics Letters•Oct 26, 2006•472 citations

Evaluations of phase-only double random phase encoding based on key-space analysis

Kazuya Nakano, Masafumi Takeda, Hiroyuki Suzuki +1 more

Although initial research shows that double-random phase encoding (DRPE) is vulnerable to known-plaintext attacks that use phase retrieval algorithms, subsequent research has shown that phase-only DRPE, in which the Fourier amplitude component of an image encrypted with classical DRPE remains constant, is resistant to attacks that apply phase retrieval algorithms. Herein, we numerically analyze the key-space of DRPE and investigate the distribution property of decryption keys for classical and phase-only DRPE. We determine the difference in the distribution property of successful decryption keys for these DRPE techniques from the numerical analysis results and then discuss the security offered by them.

Applied Optics•Feb 13, 2013•14 citations

Security analysis of phase-only DRPE based on known-plaintext attack using multiple known plaintext–ciphertext pairs

Kazuya Nakano, Masafumi Takeda, Hiroyuki Suzuki +1 more

Classical double-random phase encoding (C-DRPE) is an optical symmetric-key encryption technique. C-DRPE is reported to be vulnerable to a known-plaintext attack (KPA) that uses a phase retrieval algorithm. However, although phase-only DRPE (PO-DRPE) is reported to be more resistant to KPAs than C-DRPE, it is not obvious yet that PO-DRPE is sufficiently resistant to a KPA under any condition, because the vulnerability to KPA varies depending on various factors, such as the number of the known plaintext-ciphertext pairs that are given for the KPA, or the gray level of the known-plaintext image (i.e., binary or multivalued image). In this paper, we investigate the resistance of C-DRPE and PO-DRPE to KPA under various conditions related to the number of known plaintext-ciphertext pairs and to the gray level of the known-plaintext image.

Applied Optics•Sep 23, 2014•29 citations

Vulnerability to chosen-plaintext attack of a general optical encryption model with the architecture of scrambling-then-double random phase encoding

Yushu Zhang, Di Xiao, Wenying Wen +1 more

We demonstrate a new approach to chosen-plaintext attack on a general encryption model based on scrambling preprocessing operation and double random phase encoding (DRPE). With this attack, an opponent can access both the scrambling key and two random phase keys. We hope that our work motivates further security analysis of the optical encryption scheme combining the scrambling techniques and DRPE.

Optics Letters•Oct 31, 2013•75 citations

Iterative phase retrieval algorithms Part II: Attacking optical encryption systems

Changliang Guo, Shi Liu, John T. Sheridan

The modified iterative phase retrieval algorithms developed in Part I [Guo et al., Appl. Opt.54, 4698 (2015)] are applied to perform known plaintext and ciphertext attacks on amplitude encoding and phase encoding Fourier-transform-based double random phase encryption (DRPE) systems. It is shown that the new algorithms can retrieve the two random phase keys (RPKs) perfectly. The performances of the algorithms are tested by using the retrieved RPKs to decrypt a set of different ciphertexts encrypted using the same RPKs. Significantly, it is also shown that the DRPE system is, under certain conditions, vulnerable to ciphertext-only attack, i.e., in some cases an attacker can decrypt DRPE data successfully when only the ciphertext is intercepted.

Applied Optics•May 14, 2015•48 citations
In this paper, we analyze the security of the classical double random phase encoding (DRPE) technique in Fourier domain, as well as its extended schemes in Fresnel and fractional Fourier domains. These schemes are resistant to bruteforce attacks, for their large key spaces. However, due to the linearity property of their encryption transformations, they are vulnerable to other attacks, such as chosen-plaintext attack and known-plaintext attack. We successfully break each of the three encryption schemes with the help of a certain quantity of plaintext-ciphertext pairs. Each attack is validated by computer simulations. The cryptanalysis indicates that, to minimize the risks, it is recommendable to introduce nonlinear operations to optical encryption systems.
From the perspective of optical information security, we demonstrate that conventional phase retrieval algorithms, such as the Gerchberg–Saxton algorithm, can be still valid when extended from the Fourier transform domain into the fractional Fourier transform (FRFT) domain. Based on this extension, we propose a method of known-plaintext attack (KPA) on double random phase encoding in the fractional Fourier transform domain (DRPE-FRFT). With this attack, an opponent can access two encryption phase keys with the help of the phase retrieval algorithm in the FRFT domain, and meanwhile obtain the two FRFT order keys by using an exhaustive search. This indicates that the optical encryption scheme based on the DRPE-FRFT scheme is vulnerable to KPA due to the nature of the linearity of FRFT. The validity of this attack is verified by numerical simulations.
We demonstrate a method of chosen-plaintext attack on lensless double-random phase encoding (L-DRPE) in the Fresnel domain. With this attack an opponent can access two encryption keys with help of the impulse functions as chosen plaintexts. This shows that a lensless optical encryption scheme based on DRPE is vulnerable to chosen-plaintext attack. Cryptoanalysis also indicates that the security worry originates from the linearity of the encryption and decryption mechanism of the L-DRPE scheme. One of the interesting features of the proposed attack is that the decryption process is lossless. Numerical simulations show good agreement with theoretical analysis.
Although initial research shows that double-random phase encoding (DRPE) is vulnerable to known-plaintext attacks that use phase retrieval algorithms, subsequent research has shown that phase-only DRPE, in which the Fourier amplitude component of an image encrypted with classical DRPE remains constant, is resistant to attacks that apply phase retrieval algorithms. Herein, we numerically analyze the key-space of DRPE and investigate the distribution property of decryption keys for classical and phase-only DRPE. We determine the difference in the distribution property of successful decryption keys for these DRPE techniques from the numerical analysis results and then discuss the security offered by them.
Classical double-random phase encoding (C-DRPE) is an optical symmetric-key encryption technique. C-DRPE is reported to be vulnerable to a known-plaintext attack (KPA) that uses a phase retrieval algorithm. However, although phase-only DRPE (PO-DRPE) is reported to be more resistant to KPAs than C-DRPE, it is not obvious yet that PO-DRPE is sufficiently resistant to a KPA under any condition, because the vulnerability to KPA varies depending on various factors, such as the number of the known plaintext-ciphertext pairs that are given for the KPA, or the gray level of the known-plaintext image (i.e., binary or multivalued image). In this paper, we investigate the resistance of C-DRPE and PO-DRPE to KPA under various conditions related to the number of known plaintext-ciphertext pairs and to the gray level of the known-plaintext image.
The modified iterative phase retrieval algorithms developed in Part I [Guo et al., Appl. Opt.54, 4698 (2015)] are applied to perform known plaintext and ciphertext attacks on amplitude encoding and phase encoding Fourier-transform-based double random phase encryption (DRPE) systems. It is shown that the new algorithms can retrieve the two random phase keys (RPKs) perfectly. The performances of the algorithms are tested by using the retrieved RPKs to decrypt a set of different ciphertexts encrypted using the same RPKs. Significantly, it is also shown that the DRPE system is, under certain conditions, vulnerable to ciphertext-only attack, i.e., in some cases an attacker can decrypt DRPE data successfully when only the ciphertext is intercepted.