{'fraction_non_alphanumeric': 0.022700119474313024, 'fraction_numerical': 0.0, 'mean_word_length': 5.028776978417266, '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}}
Combining Huffman text compression with new double encryption algorithm

Information is all over the place. Laptops, computers, mobiles, everything is flooded with it. As the days pass by, data is tremendously increasing. Hence transferring, saving and securing it, is becoming a complicated and troublesome task. For considering transfer and saving of disk space, size needs to be reduced. Changing the data to meaningless form can make it immune to assailants. In this paper, an optimized approach has been proposed for dealing with both the issues of size and security. With this aim, we have combined Huffman compression with newly developed symmetric cryptographic algorithms and can be applied on text data. Paper consists of overall results of the methodology. Security analysis of new double encryption algorithms has been shown.