Abstract
The linear complexity of a new kind of keystream sequences. FCSR sequences, is discussed by use of the properties of cyclotomic polynomials. Based on the results of C. Seo’s, an upper bound and a lower bound on the linear complexity of a significant kind of FCSR sequences—l-sequences are presented.
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 callMore From: Applied Mathematics-A Journal of Chinese Universities
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.
