Related Concepts
Definition
A combination generator is a running-key generator for stream cipher applications. It is composed of several linear feedback shift registers (LFSRs) whose outputs are combined by a Boolean function to produce the keystream as depicted on Fig. 1. Then, the output sequence \({({s}_{t})}_{t\geq 0}\) of a combination generator composed of \(n\) LFSRs is given by
where \({\left ({u}_{t}^{i}\right )}_{t\geq 0}\) denotes the sequence generated by the \(i\)-th constituent LFSR and \(f\) is a function of \(n\) variables. In the case of a combination generator composed of \(n\) LFSR over F q, the combining function is a function from F q n into F q.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Brynielsson L (1986) On the linear complexity of combined shift register sequences. In: Advances in cryptology - EUROCRYPT ’85. Lecture notes in computer science, vol 219. Springer, Heidelberg, pp 156–160
Canteaut A, Filiol E (2001) Ciphertext only reconstruction of stream ciphers based on combination generators. In: Fast software encryption – FSE 2000. Lecture notes in computer science, vol 1978. Springer, Heidelberg, pp 165–180
Herlestam T (1986) On functions of linear shift register sequences. In: Advances in cryptology – EUROCRYPT ’85. Lecture notes in computer science, vol 219. Springer, Heidelberg, pp 119–129
Göttfert R, Niederreiter H (1995) On the minimal polynomial of the product of linear recurring sequences. Finite Fields Appl 1(2):204–218
Hell M, Johansson T, Brynielsson L (2009) An overview of distinguishing attacks on stream ciphers. Cryptogr Commun 1(1):71–94
Johansson T, Meier W, Muller F (2006) Cryptanalysis of Achterbahn. In: Fast software encryption – FSE 2006. Lecture notes in computer science, vol 4047. Springer, Heidelberg, pp 1–14
Naya-Plasencia M (2007) Cryptanalysis of Achterbahn-128/80. In: Fast software encryption – FSE 2007. Lecture notes in computer science, vol 4593. Springer, Heidelberg, pp 73–86
Rueppel RA, Staffelbach OJ (1987) Products of linear recurring sequences with maximum complexity. IEEE Trans Inform Theory 33(1):124–131
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Canteaut, A. (2011). Combination Generator. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_338
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_338
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering