Skip to main content
SpringerLink
Log in

Practical Attack on the Shrinking Generator

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

  • 1390 Accesses

Abstract

This work proposes an efficient attack on the Shrinking Generator based on its characterization by means of Linear Hybrid Cellular Automata. The algorithm uses the computation of the characteristic polynomials of specific sub-automata and the generation of the Galois field associated to one of the Linear Feedback Shift Registers components of the generator. Both theoretical and empirical evidences for the effectiveness of the attack are given. The two main advantages of the described cryptanalysis are the determinism of bits prediction and the possible application of the obtained results to different generators.

Research supported by the Spanish Ministry of Education and Science and the European FEDER Fund under Projects SEG2004-04352-C04-03 and SEG2004-02418.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Cattell, K., Muzio, J.C.: Synthesis of one-dimensional linear hybrid cellular automata. IEEE Transactions on Computer-Aided Design (1996)

    Google Scholar 

  2. Cattell, K., Muzio, J.C.: Tables of linear cellular automata for minimal weight primitive polynomials of degree up to 300. Technical report, University of Victoria, Department of Computer Science (1993)

    Google Scholar 

  3. Cattell, K., Zhang, S., Sun, X., Serra, M., Muzio, J.C., Miller, D.M.: One-Dimensional Linear Hybrid Cellular Automata: Their Synthesis, Properties, and Applications in VLSI Testing. Tutorial, http://www.cs.uvic.ca/mserra/CA.html

  4. 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. Ekdahl, P., Meier, W., Johansson, T.: Predicting the Shrinking Generator with Fixed Connections. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Fúster-Sabater, A., de la Guía, D.: Cellular Automata Application to the Linearization of Stream Cipher Generators. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 612–622. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Golic, J.D., O’Connor, L.: A Cryptanalysis of Clock-Controlled Shift Registers with Multiple Steps. Cryptography: Policy and Algorithms, 174–185 (1995)

    Google Scholar 

  8. Johansson, T.: Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 342–356. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Key, E.L.: An Analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators. IEEE Transactions on Information Theory 22, 732–736 (1976)

    Article  MATH  Google Scholar 

  10. Meier, W., Staffelbach, O.: Analysis of Pseudo Random Sequence Generated by Cellular Automata. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 186–199. Springer, Heidelberg (1991)

    Google Scholar 

  11. Mihaljevic, M.: Security Examination of a Cellular Automata Based Pseudorandom Bit Generator Using an Algebraic Replica Approach. In: Mattson, H.F., Mora, T. (eds.) AAECC 1997. LNCS, vol. 1255, pp. 250–262. Springer, Heidelberg (1997)

    Google Scholar 

  12. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and Applications of Cellular Automata in Cryptography. IEEE Transactions on Computers 43(12), 1346–1357 (1994)

    Article  Google Scholar 

  13. Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular Automata Computations and Secret Key Cryptography. Parallel Computing archive 30(5-6) (2004)

    Google Scholar 

  14. Simpson, L., Golic, J.D., Dawson, E.: A Probabilistic Correlation Attack on the Shrinking Generator. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 147–158. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Sun, X., Kontopidi, E., Serra, M., Muzio, J.C.: The concatenation and partitioning of linear finite state machines. International Journal of Electronics 78(5), 809–839 (1995)

    Article  Google Scholar 

  16. Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. D.E.I.O.C. University of La Laguna, 38271, La Laguna, Tenerife, Spain

    Pino Caballero-Gil

  2. Institute of Applied Physics, C.S.I.C., Serrano 144, 28006, Madrid, Spain

    Amparo Fúster-Sabater

Authors
  1. Pino Caballero-Gil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amparo Fúster-Sabater
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caballero-Gil, P., Fúster-Sabater, A. (2006). Practical Attack on the Shrinking Generator. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_108

Download citation

  • DOI: https://doi.org/10.1007/11751595_108

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation