{'fraction_non_alphanumeric': 0.010217113665389528, 'fraction_numerical': 0.0, 'mean_word_length': 5.222222222222222, '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 evolvable cellular automata based data encryption algorithm

This paper proposed a new data encryption algorithm based on evolvable cellular automata CA, by taking the CAs' initial state and rule as the evolution object, try to find out the cipher text which is close to the plaintext after evolution by CAs. The parity information was introduced and the maximum age was used as the termination condition of evolutionary algorithm which checks the parity value need for original text by decrypting the closest cipher text after evolution. The experimental results show that this encryption algorithm has a large key space and good scrambling effect, and the larger the cellular automata neighbourhood radius is, the more stable the performance of evolutionary computation will be.