A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)

Authors:
Guozhen Xiao;Shimin Wei;Kwok Yan Lam;K. Imamura
Affiliations:
Nat. Key Lab. of ISN, Xidian Univ., Xi'an;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

Fast Algorithms for Determining the Linear Complexity of Period Sequences

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Extended games-Chan algorithm for the 2-adic complexity of FCSR-sequences

Theoretical Computer Science
How Many Bits have to be Changed to Decrease the Linear Complexity?

Designs, Codes and Cryptography
Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games---Chan algorithm

Designs, Codes and Cryptography
Determining the complexity of FH/SS sequence by approximate entropy

IEEE Transactions on Communications
A fast algorithm for determining the linear complexity of periodic sequences

CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Quadratic functions with prescribed spectra

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

A fast algorithm is presented for determining the linear complexity of a sequence with period pn over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p2)