A Simple Linearisation of the Self-shrinking Generator
- Cite this paper as:
- Cardell S.D., Fúster-Sabater A. (2015) A Simple Linearisation of the Self-shrinking Generator. In: Moreno-Díaz R., Pichler F., Quesada-Arencibia A. (eds) Computer Aided Systems Theory – EUROCAST 2015. Lecture Notes in Computer Science, vol 9520. Springer, Cham
Nowadays stream ciphers are the fastest among the encryption procedures, thus they are performed in many practical applications. Irregularly decimated generators are very simple sequence generators to be used as keystream generators in stream ciphers. In this paper, a linearisation method for the self-shrinking generator has been developed. The proposal defines linear structures based on cellular automata (rules 102 or 60) able to generate the self-shrunken sequence. The obtained cellular automata are simple, easy to be implemented and can be extended to other sequence generators in a range of cryptographic interest.