线性复杂度为2~n-2~m的2~n-周期序列的k-错线性复杂度  

k-error linear complexity of 2~n-periodic sequences with linear complexity 2~n-2~m

作　　者：杨名慧[1] 朱士信[1] 

机构地区：[1]合肥工业大学数学学院,合肥230009

出　　处：《计算机应用研究》2010年第6期2299-2300,2326,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60973125);高校博士点基金资助项目(20080359003)

摘　　要：线性复杂度和k-错线性复杂度是衡量密钥序列随机性的两个重要标准,运用Chan-Games算法,得到线性复杂度为2n-2m的2n-周期二元序列的k-错线性复杂度的所有可能的值,LCk(s)=0或2n-2m-2r+1+c,2n-2r+1+c。这一结果对于进一步探讨流密码密钥序列的安全性有重要的应用价值。Linear complexity and k-error linear complexity are two important standards to scale the randomicity of key sequences. For a 2n-periodic binary sequence with linear complexity 2n-2m. This paper obtained all the possible values of the k-error linear complexity using Chan-Games algorithm, LC_ k （ s ）=0 or 2 n -2 m -2 r＋1 ＋c,2 n -2 r＋1 ＋c. The result presented of stream cipher is so important that it can be used to analyze the safety of periodic key sequences more deeply.

关 键 词：密钥序列 线性复杂度 K-错线性复杂度 Chan-Games算法 二元周期序列 

分 类 号：TN918.4[电子电信—通信与信息系统]