Skip to main content

Clock-Controlled Shift Registers and Generalized Geffe Key-Stream Generator

  • Conference paper
  • First Online:
Progress in Cryptology — INDOCRYPT 2001 (INDOCRYPT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2247))

Included in the following conference series:

Abstract

In this paper we devise a generalization of the Geffe generator that combines more than three periodic inputs over GF(q). In particular, clock-controlled shift registers are suggested as inputs. The period and the linear complexity of the generated key-stream are estimated. We also prove some new results about the period of the sequence generated by a clock-controlled shift register.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Geffe, P.R.: How to protect data with ciphers that are really hard to break. Electronics 46 (1973) 99–101

    Google Scholar 

  2. Golić, J.D.: On decimation of linear recurring sequences. Fibonacci Quarterly 33 (1995) 407–411

    MathSciNet  MATH  Google Scholar 

  3. Zierler, N.: Linear recurring sequences. Journal of the Society for Industrial and Applied Mathematics 7 (1959) 31–48

    Article  MATH  MathSciNet  Google Scholar 

  4. Golić, J.D.: Periods of interleaved and nonuniformly decimated sequences. IEEE Transactions on Information Theory 44 (1998) 1257–1260

    Article  MATH  Google Scholar 

  5. Chambers, W.G.: Clock-controlled shift registers in binary sequence generators. IEE Proceedings-Computers and Digital Techniques 135 (1988) 17–24

    Google Scholar 

  6. Gollmann, D., Chambers, W.G.: Clock-controlled shift registers: a review. IEEE Journal on Selected Areas in Communications 7 (1989) 525–533

    Article  Google Scholar 

  7. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Communications and Control Engineering Series. Springer-Verlag, Berlin (1986)

    Google Scholar 

  8. Blakley, G., Purdy, G.: A necessary and sufficient condition for fundamental periods of cascade machines to be product of the fundamental periods of their constituent finite state machines. Information Sciences: An International Journal 24 (1981) 71–91

    Article  MATH  MathSciNet  Google Scholar 

  9. Golić, J.D.: On the linear complexity of functions of periodic GF(q) sequences. IEEE Transactions on Information Theory 35 (1989) 69–75

    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

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kholosha, A. (2001). Clock-Controlled Shift Registers and Generalized Geffe Key-Stream Generator. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45311-3_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43010-0

  • Online ISBN: 978-3-540-45311-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics