一个计算指数周期序列的所有跃点的算法

周期序列的k错线性复杂度是衡量流密码系统安全性能的一个重要指标，k错线性复杂度的值随着k值的增加呈下降趋势，其中发生严格下降的点称为跃点.这里关注有限域GF(pm)上的pn周期序列，p是任意素数，讨论了该类序列的k错线性复杂度的性质，同时给出了一个算法：对于任意给定的序列，计算出其包含的所有跃点.
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.