New Video Encryption Schemes Based on Chaotic Maps

Two new encryption algorithms for secure video transmission are proposed in this paper. The two algorithms employ different types of chaotic maps to generate the keystream for encrypting the video frames. Both algorithms involve a substitution step and a permutation step to achieve confusion and diffusion requirements. For efficient transmission, the video file is compressed before being encrypted. In the basic implementation of both algorithms, MPEG-2 standard is used for compression. However, the algorithms are shown to be compliant with other compression techniques. In the permutation step, the effect of the block size used in the shuffling process is examined. Smaller blocks result in increasing the processing time, while reducing both the correlation between adjacent pixels and the peak-signal-to noise ratio of an encrypted frame. The use of a Feistel structure is investigated to enhance security and its negative impact on the encryption time is demonstrated. The experimental results of the two proposed schemes confirm that they represent different tradeoffs between security and computational efficiency. Both schemes are sensitive to slight variations in the encryption key as apparent from the obtained differential measures. The conducted comparative study shows the competitiveness of the proposed schemes to existing schemes in literature.