Analysis of the Bit-Search Generator and Sequence Compression Techniques
Algebraic attacks on stream ciphers apply (at least theoretically) to all LFSR-based stream ciphers that are clocked in a simple and/or easily predictable way. One interesting approach to help resist such attacks is to add a component that de-synchronizes the output bits of the cipher from the clock of the LFSR. The Bit-search generator, recently proposed by Gouget and Sibert, is inspired by the so-called Self-Shrinking Generator which is known for its simplicity (conception and implementation-wise) linked with some interesting properties. In this paper, we introduce two modified versions of the BSG, called MBSG and ABSG, and some of their properties are studied. We apply a range of cryptanalytic techniques in order to compare the security of the BSGs.
KeywordsInput Sequence Linear Complexity Information Rate Stream Cipher Output Sequence
- 2.Coppersmith, D., Krawczyk, H., Mansour, Y.: The shrinking generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)Google Scholar
- 5.Golomb, S.: Shift Register Sequences. Revised edn. Aegean Park Press, Laguna Hills (1982)Google Scholar
- 6.Gouget, A., Sibert, H.: The bit-search generator. In: The State of the Art of Stream Ciphers: Workshop Record, Brugge, Belgium, October 2004, pp. 60–68 (2004)Google Scholar
- 9.Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)Google Scholar