|
| 摘要: |
| 在密码学相关的应用中, 要求使用的序列的线性复杂度不小于序列周期的一半. 分析了两类周期为 pq 的四元序列在 F 4 上的线性复杂度和极小多项式, 证明了这两类序列在 F 4 上具有高的线性复杂度. |
| 关键词: 逆 Gray 映射 广义分圆 四元序列 线性复杂度 |
| DOI： |
| 分类号:TN918.1 |
| 基金项目:国家自然科学基金项目（面上项目，重点项目，重大项目） |
|
| LINEAR COMPLEXITY OF TWO CLASSES OF QUATERNARY SEQUENCES WITH PERIOD pq OVER F 4 |
|
yanfeifei,Kepinhui
|
| Abstract: |
| In cryptographics-related applications, it is required that the linear complexity of the sequence used is not less than half of the period of the sequence. The linear complexity and minimal polynomial of two classes of quaternary sequences with period pq over F 4 are analyzed. It is proved that these two classes of sequences have high linear complexity over F 4 . |
| Key words: Inverse Gray mapping generalized cyclotomy quaternary sequences linear complexity |
