Abstract
Nonlinear feedback shift registers (NFSRs) are widely used as building blocks in the design of stream ciphers. Let NFSR(f) be an NFSR with the characteristic function f and let G(f) be the set of output sequences of NFSR(f). For a given NFSR(f), if there exists an affine Boolean function l such that G(l) ⊆ G(f), then G(l) is called an affine sub-family of NFSR(f). In this paper, by skillfully combining previous ideas, the authors give a new upper bound on the order of affine sub-families of NFSR(f). Compared with the four known bounds, the bound is better than three of them, and in some cases is also better than the rest one.
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.
