论文部分内容阅读
线性复杂度是衡量序列密码学强度的重要指标,设计具有大的线性复杂度和k-error线性复杂度的序列是密码学和通信中的热点问题.Niederreiter首次发现了Fq上许多满足这个要求的周期序列.通过序列的广义离散傅立叶变换构造了一些Fq上具有极大1-error线性复杂度的周期序列,这些结果远远优于已知的结果.
Linear complexity is an important index to measure the strength of sequence cryptography. Designing a sequence with large linear complexity and k-error linear complexity is a hot issue in cryptography and communication.Niederreiter first found that many of the Fq satisfy this requirement Periodic sequences.The periodic sequences with great linear complexity of 1-error on Fq are constructed by the generalized discrete Fourier transform of the sequences, and these results far outweigh the known results.