Applied Optics

Cryptanalysis of optical security systems with significant output images

Guohai Situ, Unnikrishnan Gopinathan, David S. Monaghan, John T. Sheridan

Published Jul 9, 2007• 84 citations

Abstract

The security of the encryption and verification techniques with significant output images is examined by a known-plaintext attack. We introduce an iterative phase-retrieval algorithm based on multiple intensity measurements to heuristically estimate the phase key in the Fourier domain by several plaintext-cyphertext pairs. We obtain correlation output images with very low error by correlating the estimated key with corresponding random phase masks. Our studies show that the convergence behavior of this algorithm sensitively depends on the starting point. We also demonstrate that this algorithm can be used to attack the double random phase encoding technique.

DOI: 10.1364/ao.46.005257

Related papers

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 SPIEAug 10, 20112 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 OpticsSep 28, 202211 citations

Improved Known-Plaintext Attack on Optical Encryption Based on Double Random Phase Encoding

Wan Qin, Xiang Peng, Xiangfeng Meng +1 more

This paper analysis the security of the optical encryption scheme based on the classical double random phase encoding. We describe a known-plaintext attack which can be used to successfully access the encryption key with the pre-knowledge of only one arbiturary pair of known plaintext-ciphertext. A phase retrieval algorithm is employed in this attack. Computer simulations are made to demonstrate the effectiveness. The results show that even implementing only one round of iteration in the phase retrieval, an attacker can obtain a clear decoded plaintext (a gray-scale image) from an intercept ciphertext.

Symposium on Photonics and OptoelectronicsJun 1, 201013 citations

A known-plaintext heuristic attack on the Fourier plane encryption algorithm

Unnikrishnan Gopinathan, David S. Monaghan, Thomas J. Naughton +1 more

The Fourier plane encryption algorithm is subjected to a known-plaintext attack. The simulated annealing heuristic algorithm is used to estimate the key, using a known plaintext-ciphertext pair, which decrypts the ciphertext with arbitrarily low error. The strength of the algorithm is tested by using this estimated key to decrypt a different ciphertext which was also encrypted using the same original key. We assume that the plaintext is amplitude-encoded real-valued image, and analyze only the mathematical algorithm rather than a real optical system that can be more secure. The Fourier plane encryption algorithm is found to be susceptible to a known-plaintext heuristic attack.

Optics ExpressJan 1, 2006231 citations

Known-plaintext attack on double phase encoding encryption technique

Peng Xiang, Peng Zhang, Wei Heng-Zheng +2 more

In the field of optical information security, the most attractive work is the so-called double-random-phase encoding encryption scheme proposed by Javidi. However, the security of this cryptosystem has not been analyzed thoroughly from the point of view of cryptoanalysis. In this article, the weakness of Javidi's optical security system is carefully analyzed with a known-plain text attack. It is shown that the double-random-phase encoding encryption scheme is a linear symmetric block cipher cryptosystem and its linearity opens avenues of attacks. Under the known-plaintext attack, attacker can obtain the phase key(s) in the input plane using the typical phase retrieval algorithms and subsequently deduce the phase key(s) in the Fourier domain easily. In addition, an optical implementation of known-plain text attack is also proposed.

Acta Physica SinicaJan 1, 200614 citations

Study of imperfect keys to characterise the security of optical encryption

Lingfei Zhang, Thomas J. Naughton

In conventional symmetric encryption, it is common for the encryption/decryption key to be reused for multiple plaintexts. This gives rise to the concept of a known-plaintext attack. In optical image encryption systems, such as double random phase encoding (DRPE), this is also the case; if one knows a plaintext-ciphertext pair, one can carry out a known-plaintext attack more efficiently than a brute-force attack, using heuristics based on phase retrieval or simulated annealing. However, we demonstrate that it is likely that an attacker will find an imperfect decryption key using such heuristics. Such an imperfect key will work for the known plaintext-ciphertext pair, but not an arbitrary unseen plaintext-ciphertext pair encrypted using the original key. In this paper, we illustrate the problem and attempt to characterise the increase in security it affords optical encryption.

Jan 1, 20170 citations