Abstract
This paper presents a symmetric key cryptography technique that uses cellular automata(CA). Proposed cryptosystem has been implemented in C. State transitions of programmable cellular automata (PCA) are the basis to define certain fundamental transformations to encrypt and decrypt in the cryptographic system. Different rule configurations are used to form group cellular automata that would be used in encryption and decryption.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
