Computing the Linear Complexity in a Class of Cryptographic Sequences

摘要

In this work, we present a method of computing the linear complexity of the sequences produced by the cryptographic sequence generator known as generalized self-shrinking generator. This approach is based on the comparison of different shifted versions of a single PN-sequence. Just the analysis of binary digits in these shifted sequences allows one to determine the linear complexity of those generalized sequences. The method is simple, direct and efficient. Furthermore, the concept of linear recurrence relationship and the rows of the Sierpinski's triangle are the basic tools in this computation.