An algorithm for computing all the critical points of exponent periodic sequences
-
Abstract
The k-error linear complexity of periodic sequences is an important security indice of stream cipher systems. The k-error linear complexity decreases as the number of errors k increases, that the critical points are those where a decrease occurs in the k-error linear complexity. The pn periodic sequences over the finite field GF(pm) were focused upon, where p is a prime. Some properties of the k-error linear complexity were discussed, and an algorithm was presented for computing all the critical points for a given sequence.
-
-