Abstract
Recently people show some interest in the word-based stream ciphers. The theory of such stream ciphers requires the study of the complexity of multisequences. The 2-adic complexity is the FCSR analog of the linear complexity, and it is very useful in the study of the security of stream ciphers. The improved version of 2-adic complexity—the symmetric 2-adic complexity was presented in 2004 which is a better measure for the cryptographic strength of binary sequences. In this paper, we derive the expected value of the joint 2-adic complexity of periodic binary multisequences. A nontrivial lower bound for the expected value of the joint symmetric 2-adic complexity of periodic binary multisequences is also given.
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 call
