A fast algorithm for determining the linear complexity of periodic sequences

Details A fast algorithm for determining the linear complexity of periodic sequences A fast algorithm for determining the linear complexity of periodic sequences

2005-12-10

arxiv.org/abs/cs/0512040v1

Computer Science

Cryptography and Security

7 pages

Scientific paper

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented here generalizes both the algorithm in [4] where the period of a sequence over GF(q) is p m and the algorithm in [5] where the period of a binary sequence is 2 n p m . When m=0, the algorithm simplifies the generalized Games-Chan algorithm.

Affiliated with

Also associated with

No associations

Rating

A fast algorithm for determining the linear complexity of periodic sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast algorithm for determining the linear complexity of periodic sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast algorithm for determining the linear complexity of periodic sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557151