Linear Complexity Problem of Binary Jacobi Sequence

摘要：

　　This paper contributes to the stability of linear complexity of a binary periodic Jaeobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.

关键词： cryptography Jacobi sequence linear complexity stability of linear complexity

作者: YAN Tongjiang SUN Yuhua

作者单位: College of Sciences,China University of Petroleum,Qingdao 266555,Shandong,China College of Sciences,China University of Petroleum,Qingdao 266555,Shandong,China;State Key Laboratory

会议类型: 国内会议

会议名称: 第六届中国可信计算与信息安全学术会议

会议地点: 福州

会议语种:英文

页码: 481-484

在线出版日期: 2012-10-27（万方平台首次上网日期，不代表论文的发表时间）