环Z/(p^eq)上本原序列模整数的保熵性  

On the Distinctness of Primitive Sequences Over Z/(p^eq)Modulo Integers

作　　者：孙霓刚[1] 汪伟昕 

机构地区：[1]常州大学信息科学与工程学院,江苏常州213164

出　　处：《常州大学学报（自然科学版）》2017年第6期76-82,共7页Journal of Changzhou University：Natural Science Edition

基　　金：国家自然科学基金资助项目(61103172)

摘　　要：本原序列构造的算法可以有效抵抗面向比特的攻击,特别是抵抗代数攻击和快速相关攻击。针对环Z/(p^eq)上由次数为n的本原多项式生成的本原序列,利用中国剩余定理和梯度法,构造了使其模m后保熵性成立的充分条件。分析表明,对于给定的p,q和e,当n足够大时,本原序列模m后保熵性的充分条件一直成立。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 aprimitive polynomial of degree n over Z/（p^eq）,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.

关 键 词：整数剩余环 线性递归序列 本原序列 本原多项式 

分 类 号：O621.3[理学—有机化学]