A fast algorithm for determining the linear complexity of periodic sequences

Authors:
Shimin Wei;Guolong Chen;Guozhen Xiao
Affiliations:
Department of Computer Science & Technique, Huaibei Coal Normal College, Huaibei, Anhui, China;Department of Computer Science & Technique, Huaibei Coal Normal College, Huaibei, Anhui, China;Institute of Information Security, Xidian University, Xi’an, China
Venue:
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Year:
2005

Citing 4
Cited 0

Finite field for scientists and engineers

Finite field for scientists and engineers
Discrete mathematics and its applications

Discrete mathematics and its applications
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)

IEEE Transactions on Information Theory
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF (q)

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period pmqn over a finite field GF(q) is designed, where p andq are primes, and q is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of sequences with period qn over GF(q) and that for computing the linear complexity of sequences with period pm over GF(q).