Abstract

From the perspective of optical information security, we demonstrate that conventional phase retrieval algorithms, such as the Gerchberg–Saxton algorithm, can be still valid when extended from the Fourier transform domain into the fractional Fourier transform (FRFT) domain. Based on this extension, we propose a method of known-plaintext attack (KPA) on double random phase encoding in the fractional Fourier transform domain (DRPE-FRFT). With this attack, an opponent can access two encryption phase keys with the help of the phase retrieval algorithm in the FRFT domain, and meanwhile obtain the two FRFT order keys by using an exhaustive search. This indicates that the optical encryption scheme based on the DRPE-FRFT scheme is vulnerable to KPA due to the nature of the linearity of FRFT. The validity of this attack is verified by numerical simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.