Fast Algorithms for Determining the Linear Complexity of Period Sequences

Authors:
Guozhen Xiao;Shimin Wei
Affiliations:
-;-
Venue:
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Year:
2002

Citing 6
Cited 2

Finite field for scientists and engineers

Finite field for scientists and engineers
An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime

Information and Computation
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences

IEEE Transactions on Information Theory
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

Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games---Chan algorithm

Designs, Codes and Cryptography
Quadratic functions with prescribed spectra

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pn over GF(q), where p is an odd prime, q is a prime and a primitive root modulo p2; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pmqn over GF(q), the other is the algorithm for determining the k-error linear complexity of a sequence with period pn over GF(q), where p is an odd prime, q is a prime and a primitive root modulo p2. The algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2pn over GF(q) is also introduced. where p and q are odd prime, and q is a primitive root (mod p2). These algorithms uses the fact that in these case the factorization of xN - 1 is especially simple for N = pn, 2pn, pn qm.