Skip to main content

Keystream Generators Based on Irregular Decimation

  • Chapter
  • First Online:
Cryptography with Shrinking Generators

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 470 Accesses

Abstract

In this chapter, we study the definition and the principal characteristics of the main keystream generators based on irregular decimation: the shrinking generator, the self-shrinking generator, the modified self-shrinking generator and the generalized self-shrinking 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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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

References

  1. Blackburn, S.R.: The linear complexity of the self-shrinking generator. IEEE Trans. Inf. Theory 45(6), 2073–2077 (1999). https://doi.org/10.1109/18.782139

    Article  MathSciNet  Google Scholar 

  2. Cardell, S.D., Fúster-Sabater, A.: Modelling the shrinking generator in terms of linear CA. Adv. Math. Commun. 10(4), 797–809 (2016). https://doi.org/10.3934/amc.2016041

    Article  MathSciNet  Google Scholar 

  3. Cardell, S.D., Fúster-Sabater, A.: Discrete linear models for the generalized self-shrunken sequences. Finite Fields Appl. 47, 222–241 (2017). https://doi.org/10.1016/j.ffa.2017.06.010

    Article  MathSciNet  Google Scholar 

  4. Cardell, S.D., Fúster-Sabater, A.: Recovering decimation-based cryptographic sequences by means of linear CAs (2018). https://arxiv.org/abs/1802.02206

  5. Coppersmith, D., Krawczyk, H., Mansour, Y.: The shrinking generator. In: Stinson, D. (ed.) Advances in Cryptology – CRYPTO ’93. Lecture Notes in Computer Science, vol. 773, pp. 22–39. Springer, Berlin (1994). https://doi.org/10.1007/3-540-48329-2_3

    Google Scholar 

  6. Duvall, P.F., Mortick, J.C.: Decimation of periodic sequences. SIAM J. Appl. Math. 21(3), 367–372 (1971). https://doi.org/10.1137/0121039

    Article  MathSciNet  Google Scholar 

  7. Fúster-Sabater, A., Caballero-Gil, P.: Linear solutions for cryptographic nonlinear sequence generators. Phys. Lett. A 369(5–6), 432–437 (2007). https://doi.org/10.1016/j.physleta.2007.04.103

    Article  Google Scholar 

  8. Fúster-Sabater, A., Pazo-Robles, M.E., Caballero-Gil, P.: A simple linearization of the self-shrinking generator by means of cellular automata. Neural Netw. 23(3), 461–464 (2010). https://doi.org/10.1016/j.neunet.2009.12.008

    Article  Google Scholar 

  9. Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)

    MATH  Google Scholar 

  10. Hu, Y., Xiao, G.: Generalized self-shrinking generator. IEEE Trans. Inf. Theory 50(4), 714–719 (2004). https://doi.org/10.1109/TIT.2004.825256

    Article  MathSciNet  Google Scholar 

  11. Jacobi, C.G.J.: Über die Kreisteilung und ihre Anwendung auf die Zahlentheorie. J. Reine Angew. Math. 30, 166–182 (1846)

    Article  MathSciNet  Google Scholar 

  12. Kanso, A.: Modified self-shrinking generator. Comput. Electr. Eng. 36(5), 993–1001 (2010). https://doi.org/10.1016/j.compeleceng.2010.02.004

    Article  Google Scholar 

  13. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, New York (1986)

    MATH  Google Scholar 

  14. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122–127 (1969). https://doi.org/10.1109/TIT.1969.1054260

    Article  MathSciNet  Google Scholar 

  15. Meier, W., Staffelbach, O.: The self-shrinking generator. In: De Santis, A. (ed.) Advances in Cryptology – EUROCRYPT 1994. Lecture Notes in Computer Science, vol. 950, pp. 205–214. Springer, Berlin, Heidelberg (1995). https://doi.org/10.1007/BFb0053436

    Google Scholar 

  16. Zhang, Y., Lei, J.G., Zhang, S.P.: A new family of almost difference sets and some necessary conditions. IEEE Trans. Inf. Theory 52(5), 2052–2061 (2006). https://doi.org/10.1109/TIT.2006.872969

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive licence of Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Cardell, S.D., Fúster-Sabater, A. (2019). Keystream Generators Based on Irregular Decimation. In: Cryptography with Shrinking Generators. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-12850-0_2

Download citation

Publish with us

Policies and ethics