Abstract
We perform a numerical analysis on the double random phase encryption∕decryption technique. The key-space of an encryption technique is the set of possible keys that can be used to encode data using that technique. In the case of a strong encryption scheme, many keys must be tried in any brute-force attack on that technique. Traditionally, designers of optical image encryption systems demonstrate only how a small number of arbitrary keys cannot decrypt a chosen encrypted image in their system. However, this type of demonstration does not discuss the properties of the key-space nor refute the feasibility of an efficient brute-force attack. To clarify these issues we present a key-space analysis of the technique. For a range of problem instances we plot the distribution of decryption errors in the key-space indicating the lack of feasibility of a simple brute-force attack.
© 2007 Optical Society of America
Full Article | PDF ArticleMore Like This
Kazuya Nakano, Masafumi Takeda, and Hiroyuki Suzuki
Appl. Opt. 56(15) 4474-4479 (2017)
David S. Monaghan, Guohai Situ, Unnikrishnan Gopinathan, Thomas J. Naughton, and John T. Sheridan
Appl. Opt. 47(21) 3808-3816 (2008)
Kazuya Nakano, Masafumi Takeda, Hiroyuki Suzuki, and Masahiro Yamaguchi
Appl. Opt. 52(6) 1276-1283 (2013)