Abstract
The joint linear complexity and k error joint linear complexity of an m fold 2 periodic multisequence can be efficiently computed using Modified Games Chan algorithm and Extended Stamp Martin Algorithm respectively. In this paper we derived an algorithm for finding the joint linear complexity of n 2 . 3 periodic binary multisequence with the help of Modified Games Chan algorithm. Here we derived the minimum value of k for which k-error joint linear complexity is strictly less than the joint linear complexity of binary m fold multisequences of period 2 and an algorithm which, given a constant c and an m fold 2 periodic binary multisequence S, computes the minimum number k of errors and the associated error multisequence needed over a period of S for bringing the joint linear complexity of S below c . General Terms Cryptography, Applied Number theory, Word Based Stream Ciphers, Linear Complexity of sequences, Joint Linear Complexity of sequences
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.
