Abstract
Abstract In this work, we propose a cryptanalysis of the nonlinear sequence generator called the shrinking generator. The output sequence of this cryptographic generator, the shrunken sequence, can be modelled as one of the output sequences of linear cellular automata (CA). The shrunken sequence and the other sequences generated by the CA can be reduced to a combination of PN-sequences generated by the same characteristic polynomial. Therefore, all these PN-sequences are the same but shifted. We propose an efficient cryptanalysis that takes advantage of the linearity of these PN-sequences and the CA.
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.
