三元3n周期序列的k错线性复杂度的性质  

Some properties of the k -error linear complexity of ternary 3n -periodic sequences

作　　者：唐淼[1] 开晓山[2] 

机构地区：[1]安徽农业大学应用数学系,安徽合肥230036 [2]合肥工业大学数学学院,安徽合肥230009

出　　处：《中国科学技术大学学报》2015年第2期107-111,116,共6页JUSTC

基　　金：安徽省自然科学基金(1208085MA14);安徽农业大学数学学科建设专项(2014XKJS-307)资助

摘　　要：周期序列的线性复杂度和k错线性复杂度是衡量流密码系统的安全性能的两个重要指标.讨论了有限域F3上的3n周期序列的k错线性复杂度,得到了关于该类序列的k错线性复杂度和差错序列之间的一些性质.并且利用这些性质导出了一个结论,该结论显示了关于3n周期序列k错线性复杂度的计算如何转化成关于3n-1周期序列k错线性复杂度的计算,n为任意的正整数.Linear complexity and k error linear complexity of periodic sequences are two important security indices of stream cipher systems. The k-error linear complexity of 3n-periodic sequences over the finite field F3 was discussed, and some of its properties and error sequences were obtained. By means of the properties, a result was presented, showing how the computation of the k-error linear complexity of a sequences with period 3n can be reduced to the same computation for sequences with period 3n-1, for any positive integer n.

关 键 词：流密码 周期序列 线性复杂度 K错线性复杂度 差错序列 

分 类 号：O236.2[理学—运筹学与控制论]