Académique Documents
Professionnel Documents
Culture Documents
discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/5502504
CITATIONS READS
61 91
4 authors, including:
All content following this page was uploaded by Ching-Cherng Sun on 20 December 2016.
The user has requested enhancement of the downloaded file. All in-text references underlined in blue are added to the original document
and are linked to publications on ResearchGate, letting you access and read them immediately.
Shift-tolerance property of an optical
double-random phase-encoding encryption system
We investigate the shift-tolerance property of the decrypting phase mask in an optical double-random
phase-encoding encryption system. A simple method for improving the shift tolerance of the phase mask
is proposed. We demonstrate how the robustness to data loss of the encrypted image extends the shift
tolerance of the decrypting phase mask. The signal-to-noise ratio is calculated. Both a computer
simulation and an experiment are presented. 2000 Optical Society of America
OCIS codes: 070.4560, 070.6110.
encoding encryption system: a encryption setup, b decryption
M1
setup. x
qxrect f nexpi2n
n0
complex conjugation of expi2u, is placed on x
Fourier plane Pd2. On the output plane Pd3 the hx n rect
random phase-encoded image f xexpi2x is ob-
tained. When the original image is a real function, M1
3. Shift Tolerance of the Decrypting Phase Mask M1
As presented in Section 2, if the decrypting phase
mask on Fourier plane Pd2 in Fig. 1b is shifted a
n0
f nexpi2n
Qu, Duexpi2u u f ,
where Du denotes the Fourier transform of
(2) expi2sincu ,
f xexpi2x, is the wavelength, and f is the (5)
focal length of the Fourier lens. Since u is a ran- where we normalize the size of the encrypted image
dom function, expi2u u f will be q x to 1 and let 1 and where denotes the
randomly distributed when is larger than one pixel Fourier transform operation. If we remove the term
size of the mask. Thus the inverse Fourier trans- for u f from the summation 0 N1
in the
form of Qu, on plane Pd3 is also a random func- brackets {}, then Eq. 5 can be expressed as
qxrect
x
M1
n0
f nexpi2nsinc
f nexpi2n
f
N1
exp i2n u
f
exp i2 u
f
expi2nexpi2sincu
uf
M1
f nexpi2nsinc exp i2n u exp i2 u
f f f .
n0
Ru, n
(6)
tion, and the encrypted image cannot be decrypted. Since is a random function, the term Ru, n in
If the shift distance is less than one pixel size and Eq. 5 is a random function. When we multiply Eq.
the pixel size of the mask is D. The SNR of the 5 by the shifted decrypting phase function
quency of the mask depends on the total energy of the
M1
external noise.
fdx sinc f nexpi2n Now we consider the condition in which only a part
f
n0
of the encrypted data is used and assume that f x is
i2 a binary image. Since only of the encrypted image
exp n x n rx, n
f is used for decryption and the ideal condition is that
the encrypted image can be decrypted perfectly, the
average intensity of the decrypted image will be .
sinc f xexpi2x
f However, from Eq. 8, we know that the intensity of
exp i2
f
x
M1
n0
rx, n, (7)
the decrypted image is 2 sinc2f ; the remain-
ing energy 2 sinc2f M becomes the
noise. Thus the average intensity of the noise is
2 sinc2f MN. As a result the SNR
where rx, n is the inverse Fourier transform of Ru,
value can be expressed as
nexpi2u f and is still a random func-
tion. Thus the intensity of the decrypted image can
be expressed as N2 sinc2f
SNR . (10)
M 2 sinc2f
M1
fdx2 2 sinc2
f
f x2
n0
rx, n, (8)
Equation 10 describes the ultimate condition in
where r x, n is a uniform distributed white noise which the pixel size of the mask is infinitesimal. As
generated from the nth sampling point of the original discussed above, we need a decrypting mask with
image. From Eq. 8 it is easy to find that the image higher spatial frequency to reduce the decrypted
can still be decrypted when the decrypting mask is noise when an external noise is added. This means
shifted by more than one pixel. Since Eq. 8 is the that the pixel size of the mask must be small.
normalized result, the practical extension of the im- Therefore Eq. 10 can be used to estimate the SNR
proved shift tolerance is fL, where L is the width of value when a high-spatial-frequency mask is used.
the encrypted data used for decryption. Further- 5. Computer Simulation and Experiment
more, if the decrypting mask is placed at the match
position 0, Eq. 8 can be rewritten as In this section we numerically investigate the exten-
sion of the shift tolerance. The character E, as
M1 shown in Fig. 2a, is a binary image of 256 256
fdx2 2 f x2 rx, n.
n0
(9) pixels. Figure 2b shows a double-random phase-
encoded character E. Figures 2c, 2d, and 2e cor-
Equation 9 presents the property of the tolerance responding to 12, 34, and 78, respectively, of the
to data loss of the encrypted image. Comparing Eqs. encrypted image are blocked. When the decrypting
8 and 9, we know that the improvement of the shift phase mask is placed at the matching position in the
tolerance is caused by the spectrum extension, owing decryption process, the decrypted images of Figs.
to the spatial restriction of the encrypted image. 2b, 2c, 2d, and 2e are shown in Figs. 3a, 3b,
3c, and 3d, respectively. These figures present
4. Signal-to-Noise Ratio the robustness to the loss of the encrypted data.
In this section we investigate the SNR property of the Figures 4a 4d show the decrypted results when
decrypted image when the decrypting mask is shifted the decrypting phase mask is shifted for one pixel
from the matching position. When all the encrypted from the matching position in the transverse direc-
data are used and the shift distance of the decrypting tion. The character E cannot be decrypted when all
mask is less than one pixel size, the SNR is indepen- the encrypted data are used but can be decrypted
dent of the parameters of the optical encryption sys- when a portion of the encrypted data is used. From
tem. From Eq. 3 we know that the SNR depends Fig. 5, when the phase key is shifted for two pixels
on the shift distance and on the pixel size of the from the matching position, the character E can be
decrypting mask. Thus use of a phase mask with decrypted only when 14 and 18 the encrypted data
lower spatial frequency will produce a larger SNR are used. Figure 6 shows that, when the phase key
value when there is no external noise is added. is shifted for three pixels, the character E can be
However, as proposed in Ref. 7, the noise on the decrypted only when 18 the encrypted data is used.
decrypted image is always a white noise no matter These results demonstrate that the robustness to the
what kind of external noise is added. That is be- loss of the encrypted data extends the shift tolerance
cause the noise is uniformly distributed on the output of the decrypting phase mask. We can use a low-
plane caused by the random phase mask. Thus the pass filter to enhance the decrypted image.7 Fur-
distribution range of the noise is proportional to the thermore, from the simulation, it is worth noting that
spatial frequency of the decrypting mask, and we the capable pixel shift tolerance is the inverse of the