Abstract

Binary sequences generated by a class of linear cellular automata (multiplicative polynomial cellular automata) can be written as solutions of linear difference equations. At the same time, such solutions equal the output sequences from well known LFSR-based stream ciphers. These simple linear automata easily model complex nonlinear cryptographic generators. The modelling technique is based on the concatenation of basic 90/150 cellular automata. Some illustrative examples covering a wide range of cryptographic generators complete the work.

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 call

Disclaimer: 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.