新的周期为p<sup>m</sup>的GF(h)上广义割圆序列的线性复杂度

刘龙飞; 杨凯; 杨晓元

doi:10.11959/j.issn.1000-436x.2017181

您当前的位置：

首页 >

文章列表页 >

新的周期为p^m的GF(h)上广义割圆序列的线性复杂度

学术论文 | 更新时间：2024-06-05

- 新的周期为p^m的GF(h)上广义割圆序列的线性复杂度
- On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h)
- 通信学报 2017年38卷第9期页码：39-45
- 作者机构：
  
  1. 武警工程大学网络与信息安全武警部队重点实验室，陕西西安 710086
  2. 西安电子科技大学计算机网络与信息安全教育部重点实验室，陕西西安 710071
- 作者简介：
  
  [ "刘龙飞（1990-），男，河南沈丘人，武警工程大学讲师，主要研究方向为流密码和编码。" ]
  [ "杨凯（1983-），男，山东莱芜人，武警工程大学讲师，主要研究方向为信息安全。" ]
  [ "杨晓元（1959-），男，湖南湘潭人，武警工程大学教授、博士生导师，主要研究方向为密码学和信息安全。" ]
- 基金信息：
  
  国家密码发展基金资助项目(MMJJ20170112);国家重点研发计划基金资助项目(2017YFB0802002);国家自然科学基金资助项目(61562077);国家自然科学基金资助项目(U1636114);国家自然科学基金资助项目(64572521);国家自然科学基金资助项目(61402530);武警工程大学基础研究基金资助项目(WJY201518)
- DOI：10.11959/j.issn.1000-436x.2017181
  中图分类号： TP302
- 网络出版日期：2017-09，
  
  纸质出版日期：2017-09-25
- 稿件说明：
移动端阅览
刘龙飞, 杨凯, 杨晓元. 新的周期为p^m的GF(h)上广义割圆序列的线性复杂度[J]. 通信学报, 2017,38(9):39-45.

Long-fei LIU, Kai YANG, Xiao-yuan YANG. On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h)[J]. Journal on communications, 2017, 38(9): 39-45.
刘龙飞, 杨凯, 杨晓元. 新的周期为p^m的GF(h)上广义割圆序列的线性复杂度[J]. 通信学报, 2017,38(9):39-45. DOI： 10.11959/j.issn.1000-436x.2017181.

Long-fei LIU, Kai YANG, Xiao-yuan YANG. On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h)[J]. Journal on communications, 2017, 38(9): 39-45. DOI： 10.11959/j.issn.1000-436x.2017181.

摘要

基于Ding-广义割圆序列，构造了GF(h)上一类新的周期为p

的广义割圆序列，且该序列为平衡序列。通过分析h与p的关系及多项式理论，确定了该序列的线性复杂度。结果表明，该类序列具有良好的线性复杂度性质，将它们作为密钥流序列的密码系统具有抵抗Berlekamp-Massey算法攻击的能力。

Abstract

Based on the Ding-generalized cyclotomy

a new class of generalized cyclotomic sequences with length p

over the finite field of power of odd prime order was constructed

and the sequence was balanced.The linear complexity of the sequences was determined using the relationship between h and p and the theory of polynomial over finite field.It is shown that the sequence has good linear complexity

and it can resist attacks from the application of the Berlekamp-Massey algorithm.

关键词

Keywords

references

KLAPPER A . The vulnerability of geometric sequences based on fields of odd characteristic [J ] . Journal of Crypto , 1994 , 7 ( 1 ): 33 - 51 .

DING C S . Linear complexity of generalized cyclotomic binary sequences of order 2 [J ] . Finite Fields and Their Applications , 1997 , 8 : 159 - 174 .

DING C S , HELLESETH T . New generalized cyclotomy and its applications [J ] . Finite Fields and Their Applications , 1998 , 4 ( 2 ): 140 - 166 .

YAN T J , HUANG B J , XIAO G Z . Cryptographic properties of some binary generalized cyclotomic sequences with the length p 2 [J ] . Information Sciences , 2008 , 178 ( 3 ): 1078 - 1086 .

KIM Y J , JIN S Y , SONG H Y . Linear complexity and autocorrelation of prime cube sequences [C ] // Applicable Algebra in Engineering,Communication and Computing . 2007 : 188 - 197 .

YAN T J , LI S Q , XIAO G Z . On the linear complexity of generalized cyclotomic sequences with the period p m [J ] . Applied Mathematics Letters , 2008 , 21 ( 2 ): 187 - 193 .

DU X N , CHEN Z X . Trace representation of binary generalized cyclotomic sequences with length p m [J ] . IEICE Transaction on Fundamentals , 2011 , E94-A ( 2 ): 761 - 765 .

DING C S . Cyclic codes from the two primes sequences [J ] . IEEE Transactions on Information Theory , 2012 , 58 ( 6 ): 3881 - 3891 .

DING C S . Cyclic codes from cyclotomic sequences of order four [J ] . Finite Fields and Their Applications , 2013 , 23 ( 1 ): 8 - 34 .

CAI H , ZHOU Z C , YANG Y.et al . A new construction of frequency-hopping sequences optimal partial hamming correlation [J ] . IEEE Transactions on Information Theory , 2014 , 60 ( 9 ): 5782 - 5790 .

柯品惠 , 章海辉 , 张胜元 . 新的具有最优平均汉明相关性的跳频序列族 [J ] . 通信学报 , 2012 , 33 ( 9 ): 168 - 175 .

KE P H , ZHANG H H , ZHANG S Y . New class of frequency-hopping sequences set with optimal average Hamming correlation property [J ] . Journal on Communications , 2012 , 33 ( 9 ): 168 - 175 .

XU S D . Optimal frequency-hopping sequences sets based on cyclotomy [J ] . International Journal of Foundations of Computer Science , 2016 , 27 ( 4 ): 443 - 462 .

CAI H , LIANG H B , TANG X H . Constructions of optimal 2-D optical orthogonal codes via generalized cyclotomic classes [J ] . IEEE Transactions on Information Theory , 2015 , 61 ( 1 ): 688 - 695 .

CUSICK T W , DING C S , RENVALL A . Stream ciphers and number theory [M ] . Elsevier Science Pub Co , 1998 .

FAN C L , GE G . A unified approach to whiteman's and Ding- Helleseth's generalized cyclotomy over residue class rings [J ] . IEEE Transactions on Information Theory , 2014 , 60 ( 2 ): 1326 - 1336 .

LI D D , CHANG Z L . Linear complexity of generalised cyclotomic quaternary sequences of length 2p(m+1)q(n+1) [J ] . IET Information Security , 2016 , 10 ( 2 ): 104 - 111 .

ZHOU Y Q , CHANG Z L . Linear complexity of new generalized cyclotomic sequences of order two with odd length [J ] . IEICE Transaction on Fundamentals , 2016 , E99-A ( 8 ): 1639 - 1644 .

WANG Q Y , JIANG Y P , LIN D D . Linear complexity of binary generalized cyclotomic sequences over GF(q) [J ] . Journal of Complexity , 2015 , 31 ( 5 ): 731 - 740 .

WANG Q Y , JIANG Y P , LIN D D . Linear complexity of Ding-Helleseth sequences of order 2 over GF(l) [J ] . Cryptography and Communications , 2015 , 8 ( 1 ): 33 - 49 .

DING C S , HELLESETH T , SHAN W . On the linear complexity of legendre sequences [J ] . IEEE Transactions on Information Theory , 1998 , 44 ( 3 ): 1276 - 1278 .

WANG Q Y , LIN D D , GUANG X . On the linear complexity of legendre sequences over Fq [J ] . IEICE Transaction on Fundamentals , 2014 , E97-A ( 7 ): 1627 - 1630 .

浏览量

657

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

流密码分析方法研究综述

长度为奇素数的完备高斯整数序列构造法

卫星电话GMR-2流密码算法碰撞特性分析

基于相似度的伪随机序列中超长稀疏特征分析

多重周期序列联合二次复杂度的计算

新的周期为pm的GF(h)上广义割圆序列的线性复杂度

On the linear complexity of a new generalized cyclotomic sequence with length mover GF(h)

DOI：10.11959/j.issn.1000-436x.2017181

摘要

Abstract

关键词

Keywords

references

新的周期为p^m的GF(h)上广义割圆序列的线性复杂度

On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h)