No abstract

No abstract

No abstract

Every characters of textual message are encrypted through the encryption key of RSA algorithm and then to an array of data bits. After that the data bits are embedded to some suitable nonlinear pixel and bit positions about the entire image through system modulus of RSA algorithm. As a result, we get a watermarked image. After that we have formed three different image shares using any two components of R, G and B of entire watermarked image. At the decryption end, three key shares are assigned for each and every share. The system modulus and private key are calculated from the prime factors of key shares. The embedded data bits are being retrieved from watermarked image by the system modulus and decrypted to the corresponding characters by the key, finally to its original content.

Data bits from textual message are encrypted through key to some suitable nonlinear pixel and bit positions about the entire image. As a result, we get a watermarked image. After that we have formed three different image shares using any two components of R, G and B of entire watermarked image. The key is also divided into three different logical blocks by digits. By combining any two blocks of key we have formed key shares and have assigned to image shares. Out of those three shares, only addition of any two is able to make the full image or key. At the decryption end through appropriate arrangement of shares of key and image, make possible to retrieve hidden data bits from watermarked image and reform into its original content.