Complexity analysis of the Key-dependent Wavelet Packet Transform for JPEG2000 encryption

Key-dependent Wavelet Packet Transforms (KDWPT) have been proposed for image encryption and especially for the joint application with the JPEG2000 compression framework. An assumed advantage of this compression integrated encryption scheme is its assumed negligible computational demand. In this work we analyze the assumption (KDWPT are lightweight compared to conventional encryption) both practically by experiments with state-of-the-art implementations and theoretically (by developing a proper model for the complexity of KDWPT).