Skip to main content
SpringerLink
Log in

2SC: An Efficient Code-Based Stream Cipher

  • Conference paper
Information Security and Assurance (ISA 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 200))

Included in the following conference series:

Abstract

In this article, we present a new code-based stream cipher called 2SC, based on the sponge construction. The security of the keystream generation of 2SC is reducible to the conjectured intractability of the Syndrome Decoding (SD) problem, which is believed to be hard in the average case. Our stream cipher compares favorably with other provably secure stream ciphers such as QUAD and SYND in terms of efficiency and storage. In particular, 2SC is much faster than both these stream ciphers, requiring shorter keys and initial vectors (IVs) in order to attain comparable security levels (the runtime in terms of clock cycles is actually halved compared to SYND for around 170 bits of security, whereas the key size is about 50 bits smaller).

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 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. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: Rsa and rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194–209 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 64–83. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Berbain, C., Gilbert, H., Patarin, J.: Quad: A multivariate stream cipher with provable security. J. Symb. Comput. 44(12), 1703–1723 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(2), 384–386 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM J. Comput. 15(2), 364–383 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  6. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850–864 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Finiasz, M., Gaborit, P., Sendrier, N.: Improved fast syndrome based cryptographic hash functions. In: Rijmen, V. (ed.) ECRYPT Hash Workshop 2007 (2007)

    Google Scholar 

  8. Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-based Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88–105. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 245–255. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Peeters, M., Bertoni, G., Daemen, J., Van Assche, G.: Sponge Functions. In: ECRYPT Hash Workshop 2007 (2007)

    Google Scholar 

  11. Peeters, M., Bertoni, G., Daemen, J., Van Assche, G.: On the security of the keyed sponge construction. In: Symmetric Key Encryption Workshop, SKEW 2011 (2011)

    Google Scholar 

  12. Gaborit, P., Laudaroux, C., Sendrier, N.: Synd: a very fast code-based cipher stream with a security reduction. In: IEEE Conference, ISIT 2007, Nice, France, pp. 186–190 (July 2007)

    Google Scholar 

  13. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989: Proc. of the Twenty-first Annual ACM Symposium on Theory of Computing, pp. 25–32. ACM, New York (1989)

    Chapter  Google Scholar 

  14. Golic, J.D.: Cryptanalysis of alleged a5 stream cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 239–255. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  15. Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26, 401–406 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hong, J., Sarkar, P.: Rediscovery of time memory tradeoffs. Cryptology ePrint Archive, Report 2005/090 (2005), http://eprint.iacr.org/

  17. Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology 9(4), 199–216 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kaliski, B.S.: Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools. Phd thesis, MIT, Cambridge, MA, USA (1988)

    Google Scholar 

  19. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. Plenum Press, New York (1972)

    Google Scholar 

  20. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  21. Shor, P.W.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: SFCS 1994: Proc. of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE Computer Society, Los Alamitos (1994)

    Google Scholar 

  22. Håstad, J., Näslund, M.: Bmgl: Synchronous key-stream generator with provable security (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CASED – Center for Advanced Security Research Darmstadt, Mornewegstr. 32, 64289, Darmstadt, Germany

    Mohammed Meziani, Pierre-Louis Cayrel & Sidi Mohamed El Yousfi Alaoui

Authors
  1. Mohammed Meziani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre-Louis Cayrel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sidi Mohamed El Yousfi Alaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hannam University, 133 Ojeong-dong, Daeduk-gu, 306-791, Daejeon, South Korea

    Tai-hoon Kim

  2. The Ohio State University, 470 Hitchcock Hall, 2070 Neil Avenue, 43210-1275, Columbus, OH, USA

    Hojjat Adeli

  3. Hannam University, 133 Ojeong-dong, Daeduk-gu, 306-791, Daejeon, Korea

    Rosslin John Robles

  4. Hannam University, 133 Ojeong-dong, Daeduk-gu, Daejeon, Korea

    Maricel Balitanas

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meziani, M., Cayrel, PL., El Yousfi Alaoui, S.M. (2011). 2SC: An Efficient Code-Based Stream Cipher . In: Kim, Th., Adeli, H., Robles, R.J., Balitanas, M. (eds) Information Security and Assurance. ISA 2011. Communications in Computer and Information Science, vol 200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23141-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23141-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23140-7

  • Online ISBN: 978-3-642-23141-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation