A mathematical approach for computing the linear equivalence of a periodic key-stream sequence using fourier transform

Abstract EN

A mathematical method with a new algorithm with the aid of Mat lab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform.

The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators.

The procedure can be used with comparatively greater computational ease and efficiency.

The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalence (L) of the sequence of period (p) when (L) is greater than (p / 2).

Several examples are given for conciliated the accuracy of the results of this proposed method.