In this paper we devise a generalization of the Geffe generator that combines more than three periodic inputs over GF(q). In particular, clock-controlled shift registers are suggested as inputs. The period and the linear complexity of the generated key-stream are estimated. We also prove some new results about the period of the sequence generated by a clock-controlled shift register.
|Title of host publication||Progress in Cryptology -- Indocrypt 2001 (Chennai, India, December 16-20, 2001)|
|Editors||C.P. Rangan, C. Ding|
|Place of Publication||Berlin|
|Publication status||Published - 2002|
|Name||Lecture Notes in Computer Science|