[1]孙霓刚,汪伟昕.环Z/(peq)上本原序列模整数的保熵性[J].常州大学学报(自然科学版),2017,(06):76-82.[doi:10.3969/j.issn.2095-0411.2017.06.011]
　SUN Nigang,WANG Weixin.On the Distinctness of Primitive Sequences Over Z/(peq)Modulo Integers[J].Journal of Changzhou University(Natural Science Edition),2017,(06):76-82.[doi:10.3969/j.issn.2095-0411.2017.06.011]
点击复制

环Z/(peq)上本原序列模整数的保熵性()
分享到：

常州大学学报(自然科学版)[ISSN:2095-0411/CN:32-1822/N]

卷:
期数:
2017年06期
页码:
76-82
栏目:
信息科学与工程
出版日期:
2017-12-10

文章信息/Info

Title:
On the Distinctness of Primitive Sequences Over Z/(peq)Modulo Integers
作者:
孙霓刚; 汪伟昕
常州大学 信息科学与工程学院,江苏 常州 213164
Author(s):
SUN Nigang;  WANG Weixin
School of Information Science and Engineering, Changzhou University, Changzhou 213164, China
关键词:
整数剩余环;  线性递归序列;  本原序列;  本原多项式
Keywords:
integer residue rings;  linear recurring sequences;  primitive sequences;  primitive polynomial
分类号:
O 621.3
DOI:
10.3969/j.issn.2095-0411.2017.06.011
文献标志码:
A
摘要:
本原序列构造的算法可以有效抵抗面向比特的攻击,特别是抵抗代数攻击和快速相关攻击。针对环Z/(peq)上由次数为n的本原多项式生成的本原序列,利用中国剩余定理和梯度法,构造了使其模m后保熵性成立的充分条件。分析表明,对于给定的p,q和e,当n足够大时,本原序列模m后保熵性的充分条件一直成立。
Abstract:
Primitive sequences have a significant contribution to algorithm’s resistance against bit-oriented cryptographic attacks, including algebraic attacks and fast correlation attacks. This paper studied the primitive sequences generated by a primitive polynomial of degree n over Z/(peq), utilizing the Chinese Remainder Theorem and Gradient Method. This article provided a sufficient condition to ensure the primitive sequences are pairwise distinct modulo m. Analysis showed that, for a given p, q and e, the sufficient condition for the entropy preserving property of the primitive sequence modulo m has been established.

参考文献/References:

[1][s.n.]. ETSI/SAGE specification: specification of the 3GPP confidentiality and integrity algorithms 128-EEA3 & 128-EIA3,document 4:design and evaluation report, version: 2.0[EB/OL].(2011-09-01)
[2017-03-27]. http://zuc.dacas.cn/thread.aspx ID=2304.
[2]ZHU X Y, QI W F. On the distinctness of modular reductions of maximal length sequences modulo odd prime powers[J]. Mathematics of Computation, 2008, 77: 1623-1637.
[3]ZHENG Q X, QI W F, TIAN T. On the distinctness of modular reductions of primitive sequences over Z/(232-1)[J]. Des Codes Cryptograph, 2014, 70(3): 359-368.
[4]CHEN H J, QI W F. On the distinctness of maximal length sequences over modulo 2[J]. Finite Fields & Their Applications, 2009, 15(1): 23-39.
[5]ZHENG Q X, QI W F. A new result on the distinctness of primitive sequences over Z/(pq) modulo 2[J]. Finite Fields & Their Applications, 2011, 17(3): 254-274.
[6]ZHENG Q X, QI W F, TIAN T. On the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers[J]. Information Theory IEEE Transactions on, 2013, 59(1): 680-690.
[7]ZHENG, Q X, QI W F. Further results on the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers[J]. Information Theory IEEE Transactions on, 2013, 59(1): 4013-4019.
[8]HU Z, WANG L. Injectivity of compressing maps on the set of primitive sequences modulo square-free odd integers[J]. Cryptography & Communications, 2015, 7(4): 347-361.
[9]CHENG Y, QI W, ZHENG Q, et al. On the distinctness of primitive sequences over Z/(peq) modulo 2[J]. Cryptography and Communications, 2016, 8(3): 371-381.
[10]YANG D, QI W F, ZHENG Q X. Further results on the distinctness of modulo 2 reductions of primitive sequences over Z/(232-1)[J]. Designs Codes & Cryptography, 2015, 74(2): 467-480.
[11]BYLKOV D N, KAMLOVSKI O V. Occurrence indices of elements in linear recurring sequences over primary residue rings[J]. Problems of Information Transmission, 2008, 44(2): 161-168.
[12]KAMLOVSKII O V. Frequency characteristics of linea r recurrence sequences over Galois rings[J]. Russian Academy of Sciences Sbornik Mathematics, 2009, 200(4): 31-52.
[13]BUGEAUD Y, CORVAJA P, ZANNIER U. An upper bound for the GCD of an-1 and bn-1[J]. Mathematische Zeitschrift, 2003, 243(1): 79-84.

备注/Memo

备注/Memo:
收稿日期:2017-04-06。
基金项目:国家自然科学基金资助项目(61103172)。
作者简介:孙霓刚(1978—), 男,上海人, 博士,副教授,主要从事通信安全、密码学研究。
更新日期/Last Update: 1900-01-01