Analysis of Geffe Generator LFSR properties on the application of algebraic attack
F. Handayani, N. P. R. Adiati · AIP conference proceedings · 2019
The purpose of this research was to investigate the effect of LFSR properties in the application of algebraic attack on Geffe Generator. This research was conducted in four different cases: Case 1 with the relatively prime LFSR length and the primitive polynomial LFSR properties, Case 2 with the relatively prime LFSR length and the non-primitive polynomial LFSR properties, Case 3 with the non-relatively prime LFSR length and the primitive polynomial LFSR properties, and Case 4 with the non-relatively prime LFSR length and the non-primitive polynomial LFSR properties. The result of this research is that the relatively prime and primitive polynomials influence the length of the period of equation that is produced in algebraic attack of Geffe Generator. LFSR that have non-relatively prime and non-primitive polynomials properties cannot produce a maximum period of equation. The length of the period of equation influence both the memory complexity and the execution time on an algebraic attack.