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

Journal of Optics A Pure and Applied Optics

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

Published Apr 20, 2009• 94 citations
Publisher

Abstract

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.

DOI
10.1088/1464-4258/11/7/075402

Related papers

Optical cryptanalysis of DRPE-based encryption systems

Wan Qin, Wenqi He, Xiangfeng Meng +1 more

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.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 4, 2009•6 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

Known-plaintext attack-based analysis of double random phase encoding using multiple known plaintext–ciphertext pairs

Kazuya Nakano, Hiroyuki Suzuki

Double random phase encoding (DRPE) is vulnerable to known-plaintext attacks (KPAs) based on phase retrieval algorithms. We previously analyzed DRPE resistance to KPA cryptanalysis with multiple known plaintext-ciphertext image pairs and obtained secret keys at a higher probability rate than when performing KPA cryptanalysis using one known image pair. However, the robustness of KPA in the presence of noise or occlusion in DRPE is unclear. We analyzed KPA properties in relation to DRPE when white Gaussian noise was gradually added to the Fourier amplitude or phase of a known ciphertext complex amplitude image. Additionally, we analyzed KPA properties when the Fourier phase of the known ciphertext image was gradually occluded by zero-valued pixels. The results showed that KPAs performed using multiple known plaintext-ciphertext image pairs were largely affected by noise added to the Fourier phase and thus are not always a strong tool for DRPE cryptanalysis.

Applied Optics•Sep 28, 2022•11 citations

Known-plaintext attack on optical encryption based on double random phase keys

Xiang Peng, Peng Zhang, Hengzheng Wei +1 more

We demonstrate a new approach to known-plaintext attack on an optical encryption scheme based on double random phase keys. With this attack an opponent can access both random phase keys with the help of the phase retrieval technique. This demonstration shows that an optical encryption scheme based on double random encoding is vulnerable to known-plaintext attack.

Optics Letters•Mar 29, 2006•704 citations

Quantitative analysis on key estimation by known-plaintext attacks to DRPE

Kazuya Nakano, Hiroyuki Suzuki, Masahiro Yamaguchi +2 more

Double Random Phase Encoding (DRPE), which is a typical optical encryption technique, has been reported to be vulnerable to Known Plaintext-Attacks (KPAs) using a Phase Retrieval Algorithm (PRA). But the reported case in which the encryption key is successfully estimated was that the plain image was rather simple such as the image of a character. In addition, although Phase Only DRPE (PO-DRPE) was proposed to achieve more resistance to the KPA than Complex DRPE (C-DRPE) in which both amplitude and phase components are used as an encrypted image, no quantitative results about the relationship between the vulnerability and the plaintext image. In this paper, we show the result of quantitative analysis on KPA by PRA to C-DRPE and PO-DRPE, for the plaintext images of different characteristics. As a result of experiment, KPA to C-DRPE succeeded to estimate the correct key while the probability of success became lower when the number of non-zero pixel increases in the plaintext image. However, KPA to PO-DRPE enabled to estimate only "singular" keys, which are effective for no more than given plaintext/ciphertext image pair and far different from the correct encryption key. We also conducted KPA using two plaintext-ciphertext image pairs for KPA. In the case when two plaintext-ciphertext image pairs were given to KPA, the cryptanalysis succeeded with higher probability than the case of one. Moreover, the probability of success in the KPA was high even in PO-DRPE.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 10, 2011•2 citations

Image encryption based on fractal-structured phase mask in fractional Fourier transform domain

Meng-Dan Zhao, Xu-Zhen Gao, Yue Pan +4 more

Abstract We present an optical encryption approach based on the combination of fractal Fresnel lens (FFL) and fractional Fourier transform (FrFT). Our encryption approach is in fact a four-fold encryption scheme, including the random phase encoding produced by the Gerchberg–Saxton algorithm, a FFL, and two FrFTs. A FFL is composed of a Sierpinski carpet fractal plate and a Fresnel zone plate. In our encryption approach, the security is enhanced due to the more expandable key spaces and the use of FFL overcomes the alignment problem of the optical axis in optical system. Only using the perfectly matched parameters of the FFL and the FrFT, the plaintext can be recovered well. We present an image encryption algorithm that from the ciphertext we can get two original images by the FrFT with two different phase distribution keys, obtained by performing 100 iterations between the two plaintext and ciphertext, respectively. We test the sensitivity of our approach to various parameters such as the wavelength of light, the focal length of FFL, and the fractional orders of FrFT. Our approach can resist various attacks.

Journal of Optics•Feb 26, 2018•11 citations
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.
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.
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.
Double random phase encoding (DRPE) is vulnerable to known-plaintext attacks (KPAs) based on phase retrieval algorithms. We previously analyzed DRPE resistance to KPA cryptanalysis with multiple known plaintext-ciphertext image pairs and obtained secret keys at a higher probability rate than when performing KPA cryptanalysis using one known image pair. However, the robustness of KPA in the presence of noise or occlusion in DRPE is unclear. We analyzed KPA properties in relation to DRPE when white Gaussian noise was gradually added to the Fourier amplitude or phase of a known ciphertext complex amplitude image. Additionally, we analyzed KPA properties when the Fourier phase of the known ciphertext image was gradually occluded by zero-valued pixels. The results showed that KPAs performed using multiple known plaintext-ciphertext image pairs were largely affected by noise added to the Fourier phase and thus are not always a strong tool for DRPE cryptanalysis.
Double Random Phase Encoding (DRPE), which is a typical optical encryption technique, has been reported to be vulnerable to Known Plaintext-Attacks (KPAs) using a Phase Retrieval Algorithm (PRA). But the reported case in which the encryption key is successfully estimated was that the plain image was rather simple such as the image of a character. In addition, although Phase Only DRPE (PO-DRPE) was proposed to achieve more resistance to the KPA than Complex DRPE (C-DRPE) in which both amplitude and phase components are used as an encrypted image, no quantitative results about the relationship between the vulnerability and the plaintext image. In this paper, we show the result of quantitative analysis on KPA by PRA to C-DRPE and PO-DRPE, for the plaintext images of different characteristics. As a result of experiment, KPA to C-DRPE succeeded to estimate the correct key while the probability of success became lower when the number of non-zero pixel increases in the plaintext image. However, KPA to PO-DRPE enabled to estimate only "singular" keys, which are effective for no more than given plaintext/ciphertext image pair and far different from the correct encryption key. We also conducted KPA using two plaintext-ciphertext image pairs for KPA. In the case when two plaintext-ciphertext image pairs were given to KPA, the cryptanalysis succeeded with higher probability than the case of one. Moreover, the probability of success in the KPA was high even in PO-DRPE.
Abstract We present an optical encryption approach based on the combination of fractal Fresnel lens (FFL) and fractional Fourier transform (FrFT). Our encryption approach is in fact a four-fold encryption scheme, including the random phase encoding produced by the Gerchberg–Saxton algorithm, a FFL, and two FrFTs. A FFL is composed of a Sierpinski carpet fractal plate and a Fresnel zone plate. In our encryption approach, the security is enhanced due to the more expandable key spaces and the use of FFL overcomes the alignment problem of the optical axis in optical system. Only using the perfectly matched parameters of the FFL and the FrFT, the plaintext can be recovered well. We present an image encryption algorithm that from the ciphertext we can get two original images by the FrFT with two different phase distribution keys, obtained by performing 100 iterations between the two plaintext and ciphertext, respectively. We test the sensitivity of our approach to various parameters such as the wavelength of light, the focal length of FFL, and the fractional orders of FrFT. Our approach can resist various attacks.