Breaking an image compression and encryption scheme based on Chinese Remainder Theorem

Recently, several image compression-encryption algorithms using Chinese reminder theorem (CRT) were proposed. We presents cryptanalysis of this class of algorithms in this work. It is reported that two security defects, i.e., low sensitivity with respect to changes of plain-images and existence of equivalent secret key streams, are enough to enable a chosen-plaintext attack to successfully break these CRT-based algorithms.