{'fraction_non_alphanumeric': 0.007575757575757576, 'fraction_numerical': 0.0, 'mean_word_length': 4.8397790055248615, '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}}
An Enhancement to Caesar Cipher using Euler Totient Function

In this modern world every communication including financial transactions are taking place through the open unsecured network. In order to communicate securely through open networks the messages need to be concealed by using the cryptographic methods. The mono alphabetic traditional Cipher is Caesar cipher is the simplest and fairly popular among the available cryptographic algorithms but it is prone to brute force attack and frequency analysis test. In this paper we propose an enhancement to Caesar cipher by using the Euler Totient function to generate the key to encrypt a text file. The Euler Totient function is applied on the total number of lines of the plain text file. The key value is generated from the plain text hence for different plain text the key value is different; this makes it difficult for the adversary to guess the key thus making the encryption scheme robust. It needs to design secured key distribution schemes to be taken up as the extension work of this scheme.