A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the Number of Equivalence Classes in Certain Stream Ciphers
[chapter]
2003
Lecture Notes in Computer Science
Most common sequence generators in stream cipher systems are based on a combination of one LFSR and a nonlinear function applied to the stages of the LFSR. In these cases the linear complexity is a measure of the suitability of a keystream for its cryptographic application. This parameter depends exclusively on the particular form of the filter and the LFSR minimal polynomial. Generally speaking, there is no systematic method to predict the resulting linear complexity. The present work is
doi:10.1007/3-540-44842-x_14
fatcat:og3lgra765g7jaggqylh2l5lkq