Practical Secret Image Sharing Based on the Chinese Remainder Theorem

Compared with Shamir’s original secret image sharing (SIS), the Chinese-remainder-theorem-based SIS (CRTSIS) generally has advantages of a lower computation complexity, lossless recovery and no auxiliary encryption. However, general CRTSIS is neither perfect nor ideal, resulting in narrower range share pixels than that pixels. In this paper, we propose practical based on Asmuth Bloom’s threshold algorithm. To adapt scheme for grayscale images, our shares high seven bits each pixel utilizes least significant bit (LSB) matching technique to embed LSBs into random integer generated phase. The chosen moduli are all greater 255 [0, 255] by screening operation. values evenly distributed selection (k,n) much more flexible, which significantly improves practicality CRTSIS. Since color images RGB mode made up three channels, it easy extend images. Theoretical analysis experiments given validate effectiveness proposed scheme.