An evolvable cellular automata based data encryption algorithm
by Peng Ke; Yuanxiang Li; Fuchuan Ni
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 6, No. 1, 2013

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.

Online publication date: Sat, 11-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com