Fast selective encryption algorithms based on moments and chaos theory

Abstract

In this work, we introduce a novel selective encryption scheme based on chaos theory and momentstransforms, two moments families were considered namely Tchebichef and Hahn. The goal is to propose afast and secure encryption scheme that can be deployed in real world scenarios. The proposed algorithmsoperate in the transform domains of Tchebichef and Hahn moments. We encrypt only the most significantcoefficients of the moments transforms. First, we down sample the computed moments’ matrices coefficients,then we use two logistic maps for confusion and diffusion of the down-sampled Tchebichef’s and Hahn’scoefficients, the resulting matrix is the encrypted image. This approach improves drastically the timeperformance of the encryption algorithm while keeping a “good” security level. In order to prove theperformance of our algorithms, we run different experiments and test the algorithms on different criteria:MSE, correlation coefficient, differential analysis, entropy and time performance. The presented results provethat the encryption algorithms proposed are secure and outperform state-of-the-art algorithms.