shrinking generator is proposed. Key words: Stream cipher, pseudorandom sequence, linear complexity,. Geffe’s generator, Geffe’s shrinking. Geffe generator [5] is a non-linear random binary key sequence generator which consists of three (LFSRs) and a nonlinear combiner. Here, we. Request PDF on ResearchGate | Cryptanalysis of Geffe Generator Using Genetic Algorithm | The use of basic crypto-primitives or building blocks has a vital role.

Author: Mikalmaran Tojak
Country: Belgium
Language: English (Spanish)
Genre: Education
Published (Last): 2 February 2010
Pages: 85
PDF File Size: 16.71 Mb
ePub File Size: 3.7 Mb
ISBN: 111-8-31557-316-8
Downloads: 16294
Price: Free* [*Free Regsitration Required]
Uploader: Zulugrel

The Geffe generator Modern stream ciphers are inspired from one-time pad.

The difference with one-time pad is that stream ciphers use an algorithm or a function to generate a pseudorandom stream, named keystreamof the gdffe of the plaintext. Stream ciphers convert plaintext to ciphertext one bit at a time and are often constructed using two or more LFSRs. Because the use of LFSR alone is insufficient to provide good security, keystream generator combines outputs of linear feedback shift registers in generagor using mainly three different methods: Let’s have a close look at this Geffe generator: To create a maximal length sequence, the lengths of the three primitive polynomial must be relatively prime pairwise.


This combination function called f is defined this way: Using this boolean algebra trick: Let’s check this quickly: Click the image to view it larger in a new window You should copy, paste each VHDL code in your editor and then name each yenerator exactly as shown below: Click each image to view it gefffe in a new window 2- A more advanced stream cipher: The clock-controlled generator In nonlinear combination keystream generators Geffe generatorthe linear feedback shift registers are clocked regularly and so all the LFSRs are controlled by the same clock.

Then these LFSRs become irregularly clocked. So let’s have a look at this alternating step generator: When R1 is clocked, if its output is 1 then R2 is clocked and its ouput is XORed with the previous state of Gefte which has not been clocked. When R1 is clocked, if its output is 0 then R3 is clocked and its output is XORed with the previous state of R2 which has not been clocked.


The following steps are repeated until a keystream of desired length is produced. Don’t use this type of generator in real world with small parameters: If you want the generator generatot have good statistical properties and be quite secured, the length of the three primitive polynomial must be relatively prime pairwise and also the length of all LFSRs should be at least bits.

Click each image to view it larger in a new window.