Skip to main content

Chosen Ciphertext Attack on a New Class of Self-Synchronizing Stream Ciphers

  • Conference paper
Progress in Cryptology - INDOCRYPT 2004 (INDOCRYPT 2004)

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

Included in the following conference series:

Abstract

At Indocrypt’2002, Arnault et al. proposed a new class of self-synchronizing stream ciphers combining LFSR and FCSR architectures. It was claimed to be resistant to known attacks. In this paper, we show that such a self-synchronizing stream cipher is extremely vulnerable to chosen ciphertext attack. We can restore the secret keys easily from one chosen ciphertext with little computation. For the parameters given in the original design, it takes less than one second to restore the secret keys on a Pentium 4 processor.

Supported by National Natural Science Foundation of China (Grant No. 60273027), National Key Foundation Research 973 project (Grant No. G1999035802) and National Science Fund for Distinguished Young Scholars (Grant No. 60025205).

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. Arnault, F., Berger, T.P., Necer, A.: A New Class of Stream Ciphers Combining LFSR and FCSR Architectures. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 22–33. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Berlekamp, E.R.: Factoring polynomials over finite fields. Bell Systems Tech. J. 46, 1853–1859 (1967)

    MathSciNet  Google Scholar 

  3. Goresky, M., Klapper, A.M.: Fibonacci and Galois Representations of Feedback-With-Carry Shift Registers. IEEE Transactions on Information Theory 48(11), 2826–2836 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The Number Field Sieve. In: Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, May 1990, pp. 14–16 (1990)

    Google Scholar 

  5. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  6. Shoup, V.: A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. In: Proc. 1991 International Symposium on Symbolic and Algebraic Computation, pp. 14–21 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, B., Wu, H., Feng, D., Bao, F. (2004). Chosen Ciphertext Attack on a New Class of Self-Synchronizing Stream Ciphers. In: Canteaut, A., Viswanathan, K. (eds) Progress in Cryptology - INDOCRYPT 2004. INDOCRYPT 2004. Lecture Notes in Computer Science, vol 3348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30556-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30556-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30556-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics