{'fraction_non_alphanumeric': 0.017914267434420986, 'fraction_numerical': 0.0012795905310300703, 'mean_word_length': 4.90188679245283, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Visual Cryptography Schemes for Secret Images Encryption and Decryption

Visual cryptography is one of the techniques used to encrypt the images by dividing the original image into transparencies. The transparencies can be sent to the intended person, and at the other end the transparencies received person can decrypt the transparencies using the tool, thus gets the original image. The proposed Visual cryptography provides the demonstration to the users to show how encryption and decryption can be done to the images. In this technology, the end user identifies an image, which is not the correct image. The basic principle of the Visual Cryptography Scheme (VCS) was first introduced by Naor and Shamir. VCS is a type of clandestine distribution scheme that focuses on sharing clandestine imagery. The idea of the chart cryptography model proposed in is to split a secret image into two random shares (printed on transparencies) which separately reveals no information about the secret image other than the size of the clandestine picture. The secret picture can be reconstructed by stacking the two share. The fundamental process of this scheme is logical operation OR. In this paper, we call a VCS with random shares the traditional VCS or simply the VCS. In general, a traditional VCS takes a secret image as input, and outputs shares that satisfy two conditions: (1) any qualified subset of shares can recover the secret image, (2) any forbidden subset of shares cannot obtain any information of the secret image other than the size of the secret image.