Advertisement
Published in:
2006 | OriginalPaper | Chapter
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
Authors : Jianqin Zhou, Qiang Zheng
Published in: Cryptology and Network Security
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A fast algorithm is derived for determining the linear complexity and the minimal polynomial of periodic sequences over
GF
(3) with period 3
n
p
m
, where
p
is a prime number, and 3 is a primitive root modulo
p
2
. The algorithm presented here generalizes the fast algorithm to determine the linear complexity of a sequence over
GF
(
q
) with period
p
m
, where
p
is a prime,
q
is a prime and a primitive root modulo
p
2
.