In this paper we evaluate a lightweight encryption scheme for JPEG2000 which relies on a secret transform
domain constructed with anisotropic wavelet packets. The pseudo-random selection of the bases used for transformation
takes compression performance into account, and discards a number of possible bases which lead to
poor compression performance. Our main focus in this paper is to answer the important question of how many
bases remain to construct the keyspace. In order to determine the trade-off between compression performance
and keyspace size, we compare the approach to a method that selects bases from the whole set of anisotropic
wavelet packet bases following a pseudo-random uniform distribution. The compression performance of both
approaches is compared to get an estimate of the range of compression quality in the set of all bases. We then
analytically investigate the number of bases that are discarded for the sake of retaining compression performance
in the compression-oriented approach as compared to selection by uniform distribution. Finally, the question of
keyspace quality is addressed, i.e. how much similarity between the basis used for analysis and the basis used for
synthesis is tolerable from a security point of view and how this affects the lightweight encryption scheme.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.