Check out RSS, or use RSS reader to subscribe this item
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China
Joint Error Linear Complexity of pn-Periodic Multisequences Over Fp
Ming Su * #
Department of Computer Science,Nankai University, TianJin 300071
*Correspondence author
#Submitted by
Subject:
Funding:
Basic research funding of centralUniversities of China (No.07565010211), National Natural ScienceFoundation of China (No.No. 61003070), Supported by Ph. D. Programs Foundation of Ministry of Educationof China(No.Specialized Research Fund for the Doctoral Program ofHigher Education 200800551005)
Recent developments in stream ciphers point towards aninterest in vectorized stream ciphers. According to the definitionof the joint linear complexity of multisequence, we extend it to thejoint error linear complexity of multisequence to study thestability of multisequences. We investigate the counting functionsof the joint error linear complexity of t-multiple 2n and pn-periodic multisequences with a few term errors in each singlesequence. Moreover, we propose efficient algorithms for computingthe joint error linear complexity of these kinds of multisequences,as well as the algorithms for determining all the error vectors thatgive the joint error linear complexity. Being familiar with thedistribution and having the efficient algorithms for computing thejoint error linear complexity, we can choose the parameters of t -multiple multisequence of these kinds of multisequences forlarge joint error linear complexity purpose.
Keywords:Information security; Streamcipher; Multisequence; Joint (error) linear complexity; Distribution; Algorithms