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

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

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
For an odd prime p and positive integers r, d such that 0 < d ≤ pr , a generic construction of d-ary sequence based on Euler quotients is presented in this paper. Compared 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 pr in our construction. Furthermore, the linear complexity of the proposed sequence over prime field GF(q) with the assumption of qp?1(≡) 1 mod p2 is determined. An algorithm of computing the linear complexity of the sequence is also given. Our results indicate that, with some constrains on the support set, the new sequences possess large linear complexities.

Linear complexityEuler quotientd-ary sequence

YE Zhifan、KE Pinhui、CHEN Zhixiong

展开 >

Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou 350117, China

Department of Mathematics and Physics, Fujian Jiangxia University, Fuzhou 350108, China

School of Mathematics, Putian University, Putian 351100, China

National Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaProvincial Natural Science Foundation of FujianFoundation of Fujian Educational Committee

61772292617724762019J01273JAT170627

2019

10.1049/cje.2019.02.004

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(3)
  • 17