Abstract
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for simulation of biological systems and physical phenomena and recently to design parallel and distributed algorithms for solving task density and synchronization problems. In this paper CA are applied to construct cryptography algorithms. A new encryption concept based on one dimensional, uniform and reversible CA is proposed. A class of CA with rules specifically constructed to be reversible is used.
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.
