CAJ | 학술논문

线性复杂度是衡量序列密码学强度的重要指标,设计具有大的线性复杂度和k-error线性复杂度的序列是密码学和通信中的热点问题.Niederreiter首次发现了Fq上许多满足这个要求的周期序列.通过序列的广义离散傅立叶变换构造了一些Fq上具有极大1-error线性复杂度的周期序列,这些结果远远优于已知的结果.
선성복잡도시형량서렬밀마학강도적중요지표,설계구유대적선성복잡도화k-error선성복잡도적서렬시밀마학화통신중적열점문제.Niederreiter수차발현료Fq상허다만족저개요구적주기서렬.통과서렬적엄의리산부립협변환구조료일사Fq상구유겁대1-error선성복잡도적주기서렬,저사결과원원우우이지적결과.
Linear complexity is an important design index for assessing the cryptographic strength of a sequence.Pseudorandom sequences with large linear complexity and large k-error linear complexity is a hot topic in cryptography and communications. Niederreiter found many such periodic sequences over Fq firstly. In this paper,the authors construct some periodic sequences over Fq with very large 1-error linear complexity by the GDFT of a periodic sequence. The result is much better than the known ones.