On the Number of Equivalence Classes in Certain Stream Ciphers

  title={On the Number of Equivalence Classes in Certain Stream Ciphers},
  author={L. Javier Garc{\'i}a-Villalba},
This paper discusses the relationship between the so-called Sequential Decomposition in Cosets representation and the non-linear filter of m-sequence representation. The aim is to get some knowledge about the different nonlinear filter equivalence classes, where these filters are partitioned according to cyclic shift and conjugacy. This equivalence also indicates an identical linear complexity for all sequences in the same equivalence class. The motivation of this paper is the desire to design… 
1 Citations
Use of Spectral Techniques in the Design of Symmetrical Cryptosystems
By using the theory of finite field Fourier transforms, the subject of nonlinear filters of m-sequences is described in a language familiar to the field of signal processing and many classes of non linear filters are given a spectral interpretation and nonlinear filter with right cryptographic properties are described.


Nonlinearity Criteria for Cryptographic Functions
Nonlinearity criteria for Boolean functions are classified in view of their suitability for cryptographic design and two criteria turn out to be of special interest, the distance to linear structures and the Distance to affine functions, which are shown to be invariant under all affine transformations.
On A Fast Correlation Attack on Certain Stream Ciphers
A new algorithm for the recovery of the initial state of a linear feedback shift register when a noisy output sequence is given and the results show the importance of low-weight checks and show that the complexity of the recovery problem grows less than exponentially with the length of the shift register.
Fast Correlation Attacks on Stream Ciphers (Extended Abstract)
A common type of running key generator employed in stream cipher systems consists of n (mostly maximum-length) binary linear feedback shift registers (LFSR's) whose output sequences are combined by a
Fast correlation attacks on certain stream ciphers
Two new correlation attacks are presented to determine the initial digits of a, provided that the numbert of feedback taps is small, and are demonstrated to be successful against shift registers of considerable lengthk (typically,k=1000).
Decrypting a Class of Stream Ciphers Using Ciphertext Only
  • T. Siegenthaler
  • Computer Science, Mathematics
    IEEE Transactions on Computers
  • 1985
The conclusion from the analysis is that the pseudonoise generator's output sequence and the sequences generated by the linear feedback shift registers should be uncorrelated, which leads to constraints for the nonlinear combining function to be used.
Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers
A technique based on Zech's logarithm is described, which uses a significantly smaller table size but at the cost of increased computational complexity and the use of Coppersmith's algorithm is suggested.
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences
A method for analyzing the linear complexity of nonlinear filterings of PN-sequences that is based on the Discrete Fourier Transform is presented. The method makes use of "Blahut's theorem", which
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
New methods for fast correlation attacks, based on the theory of convolutional codes, are described, which can be applied to arbitrary LFSR feedback polynomials, in opposite to the previous methods, which mainly focus on feedback poynomials of low weight.
On the Linear Complexity of Nonlinear Filtered PN-sequences
This work, which has as starting point “the root presence test” by Rueppel, is based on the handling of binary strings instead of determinants in a finite field and provides a general lower bound for the linear complexity.
An efficient algorithm to generate binary sequences for cryptographic purposes