Abstract
In this work the use of nonlinear filtering functions applied to Linear Feedback Shift Registers (LFSRs) to generate cryptographic sequences has been studied. Emphasis is on the class of equivalent nonlinear filter generators whose elements produce exactly the same sequence. Given a pair (filtering function, LFSR), the work develops a method of computing equivalent filtering functions applied to different LFSRs, where all these filters generate exactly the same cryptographic sequence. The security of a cipher is that of its weakest equivalent. Thus this article allows one to compute weaker equivalents of apparently secure generators.
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.
