Attacking of geffe generator by solving linear equations system of the generated sequence

الملخص AR

The stream cipher is one of the important branches of modern cryptography.

The stream cipher systems depend basically on Linear Feedback Shift Register (LFSR) units.

Golomb used the recurrence relation to find the next state values of single LFSR depending on initial values, s.t.

he can be considered the first who can construct a linear equations system of a single LFSR.

Attacking of key generator means attempt to find the initial values of the combined LFSR's.

In this paper, firstly, a Golomb's method introduced to construct a linear equations system of a single LFSR.

Secondly, this method developed to construct a linear equations system of key generator (a LFSR system) where the effect of combining function of LFSR is obvious.

Lastly, before solving the linear equations system, the uniqueness of the solution must be tested, then solving the linear equations system using one of the classical methods like Gauss elimination.

Finding the solution of linear equations system means find the initial values of the generator.

One of the known generators; Geffe generator, treated as a practical example of this work.