摘要
本文直接用有限域 GF(2~m)的元表示周期序列,探计了这种表示的系数的Hamming重与序列的线性复杂度关系。利用DFT求得了周期为奇数的2元序列的线性复杂度的期望值.
In this paper,We investigate the linear complexity of periodic sequences by the DFT over GF(2~m)and establish the relationship between the Hamming weights of the spectrum vector of the sequences and their linear complexities.We also obtained the expected linear complexity of binary sequences which have odd periods,partily solved Rueppel's expected linear complexity problem.
关键词
保密通信
密码
周期序列
复杂度
cryptography
secret communication
stream cipher
pseudorandom sequence
