Linear Complexity of d-Ary Sequence Derived from Euler Quotients over GF(q)

作     者：YE Zhifan KE Pinhui CHEN Zhixiong YE Zhifan;KE Pinhui;CHEN Zhixiong

作者机构：Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Department of Mathematics and Physics Fujian Jiangxia University School of Mathematics Putian University 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2019年第28卷第3期

页      面：529-534页

核心收录：

学科分类：11[军事学] 1105[军事学-军队指挥学] 110505[军事学-密码学] 

基　　金：supported by the National Natural Science Foundation of China (No.61772292, No.61772476) the Provincial Natural Science Foundation of Fujian (No.2019J01273) the Foundation of FujianEducational Committee (No.JAT170627) 

主　　题：Linear complexity Euler quotient d-ary sequence 

摘      要：For an odd prime p and positive integers r,d such that 0r,a generic construction of dary sequence based on Euler quotients is presented in this *** with the known construction,in which the support set of the sequence is fixed and d is usually required to be a prime,the support set of the proposed sequence is flexible and d could be any positive integer less then prin our ***,the linear complexity of the proposed sequence over prime field GF（q）with the assumption of qp-1■ mod p2is *** algorithm of computing the linear complexity of the sequence is also *** results indicate that,with some constrains on the support set,the new sequences possess large linear complexities.