Key-space analysis of double random phase encryption technique

Files in This Item:
File Description SizeFormat 
Key-space analysis of double random phase encryption.pdf1.36 MBAdobe PDFDownload
Title: Key-space analysis of double random phase encryption technique
Authors: Monaghan, David S.
Gopinathan, Unnikrishnan
Naughton, Thomas J.
Sheridan, John T.
Permanent link: http://hdl.handle.net/10197/3356
Date: 10-Sep-2007
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.
Funding Details: Science Foundation Ireland
Irish Research Council for Science, Engineering and Technology
Type of material: Journal Article
Publisher: Optical Society of America
Copyright (published version): 2007 Optical Society of America
Subject LCSH: Data encryption (Computer science)
Numerical analysis
Image processing--Digital techniques
DOI: 10.1364/AO.46.006641
Language: en
Status of Item: Not peer reviewed
Appears in Collections:Electrical and Electronic Engineering Research Collection

Show full item record

SCOPUSTM   
Citations 5

62
Last Week
0
Last month
checked on Jun 15, 2018

Google ScholarTM

Check

Altmetric


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.