Abstract

We study the security of double random phase encoding when partial knowledge of the first mask is available. We propose a greedy algorithm that can be parallelized efficiently and converges with low errors.

© 2019 The Author(s)

PDF Article

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription