Abstract
We numerically demonstrate that the image encryption algorithm with intensity random filtering in the Hartley domain proposed in a recent Letter by
Chen and Zhao [Opt. Lett. 31, 3438 (2006)
] has the problem of low security. Original image information can be visually revealed only by an inverse Hartley transform without any decryption key.
© 2007 Optical Society of America
Full Article |
PDF Article
More Like This
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 Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Figures (1)
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription