摘要
具有大线性复杂度的序列可以抵抗Berlekamp-Massey算法攻击,提高数据的安全性,设计大线性复杂度伪随机序列是一个重要课题.使用d-齐次函数是增大序列的线性复杂度的一个有效方法.本文对正整数n=3m提出了一类周期为3n-1集合容量为3n的新序列集S(r),这里(r,3m-1)=1且1≤r<3m-1.通过取适当的参数r,精确地计算出了它的线性复杂度.
Application of sequences with large linear span can efficiently resist Berlekamp-Massey attack and im-prove security of data.The design of sequences with large linear span was an important research problem.A useful approach to construct sequences with large linear span was based on d-form function.For a positive integer n=3m, a sequences family S(r) with optimal correlation was proposed,where (r,3m-1)=1 and 1 ≤ r3m-1.By taking suit-able values of the parameter r, its linear span by in this paper was calculated accurately.
出处
《海南师范大学学报(自然科学版)》
CAS
2010年第3期256-258,共3页
Journal of Hainan Normal University(Natural Science)
基金
海南师范大学青年教师资助项目(QN0802)
海南省自然科学基金资助项目(808152)