p^n周期序列3错线性复杂度原序列计数公式  

Original Sequence Counting Functions of p^n Periodic Sequence 3 Error Linear Complexity

作　　者：王洪翠[1] 周建钦[1] 

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2013年第6期37-40,共4页Journal of Hangzhou Dianzi University：Natural Sciences

基　　金：浙江省自然科学基金资助项目(Y1100318)

摘　　要：k错线性复杂度作为密钥流序列稳定性的重要指标,对于衡量密钥流序列密码强度具有十分重要的意义,研究具有高k错线性复杂度的序列也一直是序列密码中的热点问题。该文在XWLI算法基础上,给出k错线性复杂度小于等于pn-1时pn周期二元序列的3错线性复杂度的原序列计数公式,并通过实例验证了该文理论的正确性和合理性,该文方法同样适用于研究pn周期q元序列的计数。The k-error linear complexity have been used to measure stability of keystream sequences .It is extremely important for studying keystream strength .The studies of high k-error linear complexity have also been a hot in stream cipher .On the basis of XWLI algorithm , counting functions on 3-error linear complexity of p n-periodic binary sequences when k-error linear complexity is less than p n-1 are derived .They are also verified by computer program .The method is also applicable to research p n-periodic q sequences .

关 键 词：密钥流序列 K错线性复杂度 k错线性复杂度分布 

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