Authors: Peng Ke; Yuanxiang Li; Fuchuan Ni
Addresses: State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China; College of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan, China ' State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China ' State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China
Abstract: 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.
Keywords: data encryption; evolutionary algorithm; evolvable cellular automata; parity information; scrambling effect; cryptography; security.
International Journal of Wireless and Mobile Computing, 2013 Vol.6 No.1, pp.66 - 71
Received: 31 May 2012
Accepted: 06 Jul 2012
Published online: 03 Apr 2013 *