{'fraction_non_alphanumeric': 0.01167883211678832, 'fraction_numerical': 0.0, 'mean_word_length': 5.017543859649122, '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}}
A novel cryptosystem using cellular automata

This work uses group cellular automata characteristics to encrypt and decrypt a block of plaintext and cipher-text respectively by symmetric key cryptography technique. Proposed system has been implemented in Java. The result has been justified by performing randomness test and a comparative analysis is done with DES. The base of the work lies in the characteristics of different CA rules and their cryptographic properties. These rules depend on the state information of its own as well as of its neighbors. Thus, dynamically it generates random and chaotic state information which are very hard to predict and reversion is very costly.