Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity

被引：0
作者：
Wilfried Meidl
Harald Niederreiter
机构：
[1] National University of Singapore,Temasek Laboratories
[2] National University of Singapore,Department of Mathematics
来源：
Applicable Algebra in Engineering, Communication and Computing | 2003年 / 14卷
关键词：
Stream Cipher; Linear Complexity; -Error Linear Complexity; Periodic Sequence;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The linear complexity and the k-error linear complexity are important concepts for the theory of stream ciphers in cryptology. Keystreams that are suitable for stream ciphers must have large values of these complexity measures. We study periodic sequences over an arbitrary finite field 𝔽q and establish conditions under which there are many periodic sequences over 𝔽q with period N, maximal linear complexity N, and k-error linear complexity close to N. The existence of many such sequences thwarts attacks against the keystreams by exhaustive search.
引用
收藏
页码：273 / 286
页数：13
相关论文
共 7 条
  • [1] Kurosawa undefined(2000)undefined IEEE Trans. Inform. Theor. 46 694-undefined
  • [2] Meidl undefined(2002)undefined J. Complexity 18 87-undefined
  • [3] Meidl undefined(2002)undefined IEEE Trans. Inform. Theor. 48 2817-undefined
  • [4] Niederreiter undefined(2003)undefined IEEE Trans. Inform. Theor. 49 501-undefined
  • [5] Pappalardi undefined(1996)undefined J. Number Theor. 57 207-undefined
  • [6] Paterson undefined(1995)undefined Des. Codes Cryptogr. 5 115-undefined
  • [7] Stamp undefined(1993)undefined IEEE Trans. Inform. Theor. 39 1398-undefined
1