Analysis of Chinese Remainder Theorem for Data Compression

Chinese remainder theorem (CRT) forms the foundation of recent simultaneous encryption and compression schemes for image data. In the schemes moduli sequence is being used as the secret key while, the number of moduli is being considered as the achievable compression ratio. However, some studies have discredited these schemes and reported the compression performance of CRT as poor or even negative. In this study, we have investigated parameters that effect the compression performance of CRT. We have performed our experiments on KODAK dataset. Our analysis links the degraded compression performance of CRT with the number of moduli i.e. the block size to be compressed. Further, our results have shown an improved performance for smaller number of moduli. We have achieved an average compression ratio of about 8% on KODAK dataset.