Compression Performance Analysis of a Sort of Fast Binary Image Encryption Algorithms

Multimedia encryption algorithms are widely studied in recent years. However, the performances of those algorithms are usually checked by qualitative analysis and simulations. In this paper, the compression performance of a sort of encryption algorithms for binary image is analyzed quantitatively using information theories. It shows that those algorithms are good at performances including security, speed, compression ratio, robustness and format-compliance, and therefore suitable for practical use.