Advertisement

The Software-Oriented Stream Cipher SSC2

  • Muxiang Zhang
  • Christopher Carroll
  • Agnes Chan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1978)

Abstract

SSC2 is a fast software stream cipher designed for wireless handsets with limited computational capabilities. It supports various private key sizes from 4 bytes to 16 bytes. All operations in SSC2 are word-oriented, no complex operations such as multiplication, division, and exponentiation are involved. SSC2 has a very compact structure that makes it easy to implement on 8-,16-, and 32-bit processors. Theoretical analysis demonstrates that the keystream sequences generated by SSC2 have long period, large linear complexity, and good statistical distribution.

Keywords

Boolean Function Mobile Station Encryption Algorithm Linear Complexity Stream Cipher 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    R. P. Brent,“On the periods of generalized Fibonacci recurrences”, Mathematics of Computation, vol. 63, pp. 389–401, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    T. M. Cover and Y. A. Thomas, Elements of Information Theory, John Wiley, 1991.Google Scholar
  3. 3.
    R. Forre, “A fast correlation attack on nonlinearly feedforward filtered shift register sequences”, Advances in Cryptology-Proceedings of EUROCRYPT’89 (LNCS 434), 586–595, 1990.Google Scholar
  4. 4.
    F. James, “A review of pseudo-random number generators”, Computer Physics Communications, vol. 60, pp. 329–344, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    E. L. Key, “An analysis of the structure and complexity of nonlinear binary sequence generators”, IEEE Transactions on Infor. Theory, vol. 22, Nov. 1976.Google Scholar
  6. 6.
    D. E. Knuth, The Art of Computer programming. Volume 2: Seminumerical Algorithms, 3rd Edition, Addison-Wesley, 1997.Google Scholar
  7. 7.
    G. Marsaglia, “A current view of random number generators”, Computer Science and Statistics: Proc. 16th Symposium on the Interface, Elsvier Science Publishers B. V. (North-Holland), 1985.Google Scholar
  8. 8.
    W. Meier and O. Staffelbach, “Fast correlation attacks on stream ciphers”, Journal of Cryptology, vol. 1,no.3, 159–176, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    FIPS 180, “Secure hash standard”, Federal Information Processing Standard Publication 180, April, 1995.Google Scholar
  10. 10.
    M.J.B. Robshow, “Stream ciphers”, Technical Report TR-701 (version 2.0), RSA Laboratories, 1995.Google Scholar
  11. 11.
    R. Rueppel, “Stream Ciphers” in Contemporary Cryptology: The Science of Information Integrity, G.J. Simmons, ed., IEEE Press, 1992, pp. 65–134.Google Scholar
  12. 12.
    R. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, Berlin, 1986.zbMATHGoogle Scholar
  13. 13.
    B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley & Sons, New York, 2nd edition, 1996.zbMATHGoogle Scholar
  14. 14.
    T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Transactions on Computing, vol. 34, 1985, 81–85.CrossRefGoogle Scholar
  15. 15.
    T. Siegenthaler, “Cryptanalyst’s representation of nonlinearity filtered ml-sequences”, Advances in Cryptology-Proceedings of Eurocrypt’85 (LNCS), Springer-Verlag, 1986.Google Scholar
  16. 16.
    A. Biryukov and A. Shamir, “Real time cryptanalysis of the alleged A5/1 on a PC”, in this Proceedinds.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Muxiang Zhang
    • 1
  • Christopher Carroll
    • 1
  • Agnes Chan
    • 2
  1. 1.GTE Laboratories Inc.Waltham
  2. 2.College of Computer ScienceNortheastern UniversityBoston

Personalised recommendations