{'fraction_non_alphanumeric': 0.03170289855072464, 'fraction_numerical': 0.0036231884057971015, 'mean_word_length': 5.314285714285714, '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}}
Implementation and Analysis of Homomorphic Encryption Schemes

An encryption scheme is “homomorphic” if it is possible to perform implicit operation on the plaintext by processing the ciphertext only. The scheme is said to be “fully homomorphic’’ when we can perform (a sequence of operations) both addition and multiplication, whereas, it is “somewhat homomorphic’’ if it supports a limited number of operations. We describe how Gentry’s transformation can be applied on bootstrappable Somewhat Homomorphic Encryption (SHE) scheme to make it a fully homomorphic scheme (FHE) by squashing the decryption circuit i.e. evaluating with a low-degree polynomial. The security of the above scheme is based on the hardness of Approximate Integer Common Divisor Problem (ACDP) which was introduced in 2001 by Howgrave–Graham. Among the two versions of ACDP, the general version (GACDP) is apparently more secure than its partial version (PACDP). We have implemented and analyzed Gentry’s scheme and have suggested some improvements to make it more secure by selecting the Keys parameter in the permissible range.