k-error linear complexity of binary cyclotomic generators

被引:0
|
作者
Chen Z. [1 ]
Wu C. [1 ,2 ]
机构
[1] Provincial Key Laboratory of Applied Mathematics, Putian University, Putian
[2] School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu
来源
Tongxin Xuebao/Journal on Communications | 2019年 / 40卷 / 02期
基金
中国国家自然科学基金;
关键词
Ding-Helleseth-Lam sequence; Discrete Fourier transform; Hall's sextic residue sequence; K-error linear complexity; Legendre sequence;
D O I
10.11959/j.issn.1000-436x.2019034
中图分类号
学科分类号
摘要
In terms of the discrete Fourier transforms, the k-error linear complexities over F2 were discussed for Legendre, Ding-Helleseth-Lam, and Hall's sextic residue sequences of odd prime period p. More precisely, the 1-error linear complexities of these sequences were determined. Then, with some special restrictions of the order of 2 modulo p, partial results on their k-error linear complexities (k≥2 ) were proved. © 2019, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码:197 / 206
页数:9
相关论文
共 35 条
  • [1] Cusick T., Ding C., Renvall A., Stream Ciphers and Number Theory, (2004)
  • [2] Ding C., Pattern distributions of Legendre sequences, IEEE Transactions on Information Theory, 44, 4, pp. 1693-1698, (1998)
  • [3] Ding C., Helleseth T., Shan W., On the linear complexity of Legendre sequences, IEEE Transactions on Information Theory, 44, 3, pp. 1276-1278, (1998)
  • [4] Kim J., Song H., Trace representation of Legendre sequences, Designs, Codes and Cryptography, 24, 3, pp. 343-348, (2001)
  • [5] Ding C., Helleseth T., Lam K., Several classes of binary sequences with three-level autocorrelation, IEEE Transactions on Information Theory, 45, 7, pp. 2606-2612, (1999)
  • [6] Kim J., Song H., On the linear complexity of Hall's sextic residue sequences, IEEE Transactions on Information Theory, 47, 5, pp. 2094-2096, (2001)
  • [7] Kim J., Song H., Gong G., Trace Function Representation of Hall's Sextic Residue Sequences of Period p≡7(Mod 8), pp. 23-32, (2003)
  • [8] Cai Y., Ding C., Binary sequences with optimal autocorrelation, Theoretical Computer Science, 410, 24-25, pp. 2316-2322, (2009)
  • [9] Ding C., Helleseth T., On cyclotomic generator of orderr, Information Processing Letters, 66, 1, pp. 21-25, (1998)
  • [10] Wang Q., Lin D., Guang X., On the linear complexity of Legendre sequences over F<sub>g</sub>, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 97, 7, pp. 1627-1630, (2014)