| 本文已被：浏览 4565次 下载 6235次 |
码上扫一扫！ |
|
|
| Fq上具有极大1-error线性复杂度的周期序列 |
|
胡红钢1,2, 冯登国1
|
|
1.信息安全国家重点实验室,中国科学院研究生院,北京,100049;2.中国科学院,电子学研究所,北京,100080
|
|
| 摘要: |
| 线性复杂度是衡量序列密码学强度的重要指标,设计具有大的线性复杂度和k-error线性复杂度的序列是密码学和通信中的热点问题.Niederreiter首次发现了Fq上许多满足这个要求的周期序列.通过序列的广义离散傅立叶变换构造了一些Fq上具有极大1-error线性复杂度的周期序列,这些结果远远优于已知的结果. |
| 关键词: 周期序列 广义离散傅立叶变换 线性复杂度 1-error线性复杂度 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Nature Science Foundation under Grant No.60273027(国家自然科学基金);the National Grand Fundamental Research 973 Program of China under Grant No.G1999035802(国家重点基础研究发展规划(973));the National Science Fund for Distinguished Yong Scholarsunder Grant No.60025205(国家杰出青年科学基金) |
|
| Periodic Sequences with very Large 1-Error Linear Complexity over Fq |
|
HU Hong-Gang,FENG Deng-Guo
|
| Abstract: |
| 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. |
| Key words: periodic sequence GDFT linear complexity 1-error linear complexity |
