Abstract
The linear complexicy profile was introduced by Rueppel [7], [8, Ch. 4] as a cool for the assessment of keystream sequences with respect to randomness and unpredictability properties. In the following let F be an arbitrary field. We recall that a sequence of elements of F is called a kth-order linear feedback shift register (LFSR) sequence if it satisfies a kth-order linear recursion with constant coefficients from F. The zero sequence O,O,... is viewed as an LFSR sequence of order 0. Now let S be an arbitrary sequence s1,s2,... of elements of F. For a positive integer n the (local) linear complexity Ln(S) is defined as the least k such that s1,s2,...,sn form the first n terms of a kth-order LFSR sequence. The sequence L1(S),L2(S),... of integers is called the linear complexity profile (LCP) of S. For basic facts about the LCP see [4], [7], [8, Ch. 4].
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.
