THE DISTRIBUTION FUNCTIONS FOR THE LINEAR COMPLEXITY OF PERIODIC SEQUENCES  

作　　者：Yang Minghui Zhu Shixin 

机构地区：[1]School of Computer & Information, Hefei University of Technology, Hefei 230009, China [2]School of Mathematics, Hefei University of Technology, Hefei 230009, China

出　　处：《Journal of Electronics(China)》2012年第3期211-214,共4页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China (No. 60973125)

摘　　要：Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period over using Discrete Fourier Transform (DFT), where and the characteristics of are odd primes, gcd and is a primitive root modulo The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N = 2n^l over Fq using Discrete Fourier Transform （DFT）, where n and the characteristics of Fq are odd primes, gcd （n,q）=1 and q is a primitive root modulo 2n^l. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.

关 键 词：Linear complexity Periodic sequences Discrete Fourier Transform (DFT) 

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