Shares gives more better and noisy image. Thus, after encrypting the original image with AES first, and then, regenerating the Shares of all the generated shares, the reconstructed image is:Ī symmetric key based encryption (AES encryption) at both the ends of KN SharesĪlgorithm is added to make the image more secure. Required (in this case k = 6), we will get a partial image. We can get the original image only by stacking k or more shares. The experimental result after encryption by the kn encryption algorithm is given below: We experimented K-N sharing algorithm on Lena image. Visual Cryptography by Naor and Shamir for Monochrome images.Implementing 2 visual cryptographic algorithms namely, Find the file knshare.fig, execute command "run knshare" in Matlab's console Change matlab's current path to the folderĤ. Copy all matlab files in a folder to your computerģ. The key which is used to encrypt the image originally is now required again to decrypt it, thus providing an additional level of security. After the original image is generated it is still in encrypted form. These N shares can be distributed but, the end user needs only K of these shares to generate the original image. Further, the encrypted image is divided into N different shares using K N Secret Sharing Algorithm. This image is encrypted using a key given by the user. In this project we take any image which is to be shared secretly. Visual Cryptography using KN secret Sharing
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |