Share Email Print

Proceedings Paper

Analysis of double random phase encryption from a key-space perspective
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The main advantage of the double random phase encryption technique is its physical implementation however to allow us to analyse its behaviour we perform the encryption/decryption numerically. A typically strong encryption scheme will have an extremely large key-space, which will make the probable success of any brute force attack on that algorithm miniscule. Traditionally, designers of optical image encryption systems only demonstrate how a small number of arbitrary keys cannot decrypt a chosen encrypted image in their system. We analyse this algorithm from a key-space perspective. The key-space of an encryption algorithm can be defined as the set of possible keys that can be used to encode data using that algorithm. 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.

Paper Details

Date Published: 20 September 2007
PDF: 11 pages
Proc. SPIE 6695, Optics and Photonics for Information Processing, 66950Q (20 September 2007); doi: 10.1117/12.737284
Show Author Affiliations
David S. Monaghan, National Univ. of Ireland, Dublin (Ireland)
Guohai Situ, National Univ. of Ireland, Dublin (Ireland)
James Ryle, National Univ. of Ireland, Dublin (Ireland)
Unnikrishnan Gopinathan, National Univ. of Ireland, Dublin (Ireland)
Thomas J. Naughton, National Univ. of Ireland, Maynooth (Ireland)
John T. Sheridan, National Univ. of Ireland, Dublin (Ireland)

Published in SPIE Proceedings Vol. 6695:
Optics and Photonics for Information Processing
Abdul A.S. Awwal; Khan M. Iftekharuddin; Bahram Javidi, Editor(s)

© SPIE. Terms of Use
Back to Top