Selective encryption in the CCSDS standard for lossless and near-lossless multispectral and hyperspectral image compression

In this paper, we investigate low-complexity encryption solutions to be embedded in the recently proposed CCSDS standard for lossless and near-lossless multispectral and hyperspectral image compression. The proposed approach is based on the randomization of selected components in the image compression pipeline, namely the sign of prediction residual and the fixed part of Rice-Golomb codes, inspired by similar solutions adopted in video coding. Thanks to the adaptive nature of the CCSDS algorithm, even simple randomization of the sign of prediction residuals can provide a sufficient scrambling of the decoded image when the encryption key is not available. Results on the standard CCSDS test set show that the proposed technique uses on average only about 20% of the keystream compared to a conventional stream cipher, with a negligible increase of the rate of the encoder