Skip to main content

Combination Generator

  • Reference work entry
Encyclopedia of Cryptography and Security
  • 115 Accesses

Related Concepts

Boolean Functions; Linear Feedback Shift Register; Stream Cipher

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

$$ {s}_{t} = f\left ({u}_{t}^{1},{u}_{ t}^{2},\ldots,{u}_{ t}^{n}\right )\!,\qquad \forall t \geq 0, $$

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.

Combination Generator. Fig. 1
figure 1_338

Combination generator

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. 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

    Chapter  Google Scholar 

  2. 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

    Chapter  Google Scholar 

  3. 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

    Google Scholar 

  4. Göttfert R, Niederreiter H (1995) On the minimal polynomial of the product of linear recurring sequences. Finite Fields Appl 1(2):204–218

    Article  MATH  MathSciNet  Google Scholar 

  5. Hell M, Johansson T, Brynielsson L (2009) An overview of distinguishing attacks on stream ciphers. Cryptogr Commun 1(1):71–94

    Article  MATH  MathSciNet  Google Scholar 

  6. 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

    Chapter  Google Scholar 

  7. 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

    Chapter  Google Scholar 

  8. Rueppel RA, Staffelbach OJ (1987) Products of linear recurring sequences with maximum complexity. IEEE Trans Inform Theory 33(1):124–131

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics