Linear Complexity of New Generalized Cyclotomic Sequences of Order Two and Length pqr

CHANG Zu-ling; ZHOU Yu-qian; KE Pin-hui

doi:10.3969/j.issn.0372-2112.2015.01.026

您当前的位置：

首页 >

文章列表页 >

Linear Complexity of New Generalized Cyclotomic Sequences of Order Two and Length pqr

更新时间：2025-07-16

- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two and Length pqr
- Acta Electronica Sinica Vol. 43, Issue 1, Pages: 166-170(2015)
- 作者机构：
  
  1. 郑州大学数学与统计学院,河南,郑州,450001
  2. 北京邮电大学网络与交换技术研究院,北京,100876
  3. 福建师范大学网络安全与密码技术重点实验室,福建,福州,350007
  4. 郑州大学数学与统计学院,河南,郑州,450001
  5. 北京邮电大学网络与交换技术研究院,北京,100876
  6. 福建师范大学网络安全与密码技术重点实验室,福建,福州,350007
- 作者简介：
- 基金信息：
  
  Joint Funds of the National Natural Science Foundation of China (No.U1304604);Youth Fund of National Natural Science Foundation of China (No.61102093);Key Project of Science and Technology Research of Education Department of Henan Province (No.14A110022)
- DOI：10.3969/j.issn.0372-2112.2015.01.026
  CLC： TN918.1
- Published：2015
- 稿件说明：
移动端阅览
CHANG Zu-ling, ZHOU Yu-qian, KE Pin-hui. Linear Complexity of New Generalized Cyclotomic Sequences of Order Two and Length pqr[J]. Acta Electronica Sinica, 2015, 43(1): 166-170.
DOI：

CHANG Zu-ling, ZHOU Yu-qian, KE Pin-hui. Linear Complexity of New Generalized Cyclotomic Sequences of Order Two and Length pqr[J]. Acta Electronica Sinica, 2015, 43(1): 166-170. DOI： 10.3969/j.issn.0372-2112.2015.01.026.

摘要

具有良好随机性质的伪随机序列在流密码和通信领域中有着广泛的应用.本文构造出一类新的长为

pqr

的2阶广义分圆序列

并且计算其线性复杂度和极小多项式.结果显示这种序列具有高线性复杂度.

Abstract

Pseudorandom sequences with good randomness properties are widely used in stream ciphers and communications.This paper introduces one new class of generalized cyclotomic sequences of order two and length

pqr

then calculates the linear complexity and the minimal polynomial of these sequences.The results show that the new cyclotomic sequences have high linear complexity.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The 4-Error Linear Complexity of Binary Periodic Sequences

A Note on Trace Representation of Legendre Sequences

The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)

A Relationship Between Autocorrelation and Linear Complexity

On the k-Error Linear Complexity of Binary Period Sequences

Related Author

QI Wen-feng

PI Fei

CHEN Zhi-xiong

DU Xiao-ni

WANG Jin-ling

WANG Hui-juan

LI Xue-lian

HU Yu-pu

Related Institution

State Key Laboratory of Information SecurityChinese Academy of SciencesBeijing 100190China

Department of Applied MathematicsInformation Engineering InstituteInformation Engineering UniversityZhengzhouHenan 450002China

State Key Laboratory of Information Security,Chinese Academy of Sciences

Department of Applied Mathematics,Information Engineering Institute,Information Engineering University

College of Mathematic and Information Science,Northwest Normal University

⁰