%0 Journal Article
%T Joint linear complexity of periodic multi-sequences and its generalized bit-wise negative sequences over FP<br>P元周期多序列及其广义对偶多序列的复杂性分析*
%A WANG Ju-xiang
%A ZHU Shi-xin
%A <br>王菊香
%A 朱士信
%J 计算机应用研究
%D 2011
%I 
%X On base of the new definition of generalized duality multi-sequences over field FP,this paper presented the relation between the minimum polynomials of periodic multi-sequences and its generalized duality multi-sequences.Besides,it gave the properties about joint linear complexity of them.The results can be used to analyze the joint linear complexity of periodic multi-sequences of stream ciphers.
%K joint linear complexity
%K minimum polynomial
%K generalized duality multi-sequences
%K stream ciphers<br>联合线性复杂度
%K 极小多项式
%K 广义对偶多序列
%K 流密码
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F8EB868F38CE0725021A61A3DD5CB08&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=16CE8090D186839B&eid=AD07B495A9DBD65C&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=15