A fast algorithm for determining the minimal polynomial of a sequence with period 2pn GF (q)

被引：19

作者：

Wei, SM ^{[1
]}

Xiao, GZ

Chen, Z

机构：

[1] Peking Univ, Dept Comp Sci & Tech, Res Grp Informat Secur, Beijing 100871, Peoples R China

[2] Huaibei Coal Normal Coll, Dept Math, Huaibei 235000, Anhui, Peoples R China

[3] Xidian Univ, Natl Key Lab ISN, Xian 710071, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 10期

基金：

中国国家自然科学基金;

关键词：

codes; cryptography; fast algorithm; linear complexity; minimal polynomial; periodic sequence;

D O I：

10.1109/TIT.2002.802609

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2p(n) over GF (q), where p and q are odd prime, and q is a primitive root (mod p(2)). The algorithm uses the fact that in this case the factorization of x(2)p(n) - 1 is especially simple.

引用

页码：2754 / 2758

页数：5

共 6 条

[1] A GENERALIZATION OF THE DISCRETE FOURIER-TRANSFORM - DETERMINING THE MINIMAL POLYNOMIAL OF A PERIODIC SEQUENCE [J].

BLACKBURN, SR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) :1702-1704

[2]

Ding C., 1991, STABILITY THEORY STR

[3] A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2N [J].

GAMES, RA ;

CHAN, AH .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :144-146

[4]

McEliece Robert J., 1987, Finite Fields for Computer Scientists and Engineers

[5]

Rosen Kenneth H., 1984, Elementary number theory and its applications

[6] A fast algorithm for determining the linear complexity of a sequence with period pn over GF (q) [J].

Xiao, GZ ;

Wei, SM ;

Lam, KY ;

Imamura, K .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) :2203-2206

← 1 →