{'fraction_non_alphanumeric': 0.012100259291270527, 'fraction_numerical': 0.001728608470181504, 'mean_word_length': 4.488151658767772, '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}}
SET REPLACEMENTS Technique

Cryptography is the science of writing in secret code. In substitution algorithms known to us there are keys which decide the cipher text of every letter we want to transmit and these cipher texts remain constant throughout the message. So, when such algorithms are used to encrypt long messages, an attacker may easily find out and note down the common 2-letter or 3-letter words used and with the help of those letters and some brute force he will be able to decrypt the entire message. To overcome this crisis or this drawback we have come up with a solution SET REPLACEMENTS technique. Set Replacements technique is a substitution algorithm which allows you to have a different cipher text for every instance of the same letter i.e. every time you use a letter which is repeated twice or thrice in the word, it will have a different cipher text replacing it on its every instance. This will ensure that the attacker will not be able to note down the repeatedly used words or common words and decrypt the entire message using those key words and some brute force, thus securing the confidentiality of the message to its roots.