Cryptography with cellular automata
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
An improved ant colony optimisation and its application on multicast routing problem
International Journal of Wireless and Mobile Computing
An improved multidimensional scaling localisation algorithm
International Journal of Wireless and Mobile Computing
A big data based data storage systems for rock burst experiment
International Journal of Wireless and Mobile Computing
Study on urban three-lane mixed traffic flow with buses based on the Nagel-Schreckenberg model
International Journal of Wireless and Mobile Computing
A novel complex community network division algorithm with multi-gene families encoding
International Journal of Wireless and Mobile Computing
Unstructured data extraction of Chinese expert web page
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
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.