Skip to main content
SpringerLink
Log in

A stream cipher based on linear feedback over GF(28)

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 1998)

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

Included in the following conference series:

Abstract

Embedded applications such as voice encryption in wireless telephones can place severe constraints on the amount of processing power, program space and memory available for software encryption algorithms. Additionally, some protocols require some form of two-level keying which must be reasonably fast. This paper introduces a mechanism for creating a family of stream ciphers based on Linear Feedback Shift Registers over the Galois Finite Field of order 2n, where n is chosen to be convenient for software implementation. A particular stream cipher based on this methodology, SOBER, is presented and analysed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. See Ross Anderson's posting on USENET newsgroup sci.crypt, “Subject: A5 (Was: HACKING DIGITAL PHONES)”, 17 Jun 1994,. Alternatively, S. B. Xu, D. K. He, and X. M. Wang, “An implementation of the GSM General Data Encryption Algorithm A5”, CHINACRYPT '94, Xidian, China, 11–15 November 1994, pp 287–291 (in Chinese). The latter appears to be based on the same information as Anderson's posting (or possibly the posting itself) as Anderson states that two of the registers have unknown polynomials, but the polynomials are the same in his posting and Xu et.al.

    Google Scholar 

  2. W. Caelli, E Dawson, L. Nielsen, H. Gustafson, “CRYPT-X Stastical Package Manual, Measuring the strength of Stream and Block Ciphers”, Queensland Univeristy of Technology, 1992, ISBN 0-86856-8090.

    Google Scholar 

  3. T. Herlestam, “On functions of Linear Shift Register Sequences”, in Franz Pichler, editor, Proc. EUROCRYPT 85, LNCS 219, Springer-Verlag 1986.

    Google Scholar 

  4. G. Marsaglia, “DIEHARD”, http://stat.fsu.edu/~geo/diehard.html

    Google Scholar 

  5. A. Menezes, P. Van Oorschot, S. Vanstone, “Handbook of Applied Cryptography”, CRC Press, 1997, Ch 6.

    Google Scholar 

  6. C. Paar, Ph.D. Thesis, “Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields”, Institute for Experimental Mathematics, University of Essen, 1994, ISBN 3-18-332810-0.

    Google Scholar 

  7. B. Schneier, “Applied Cryptography Second Edition”, Wiley 1996, pp. 369–413.

    Google Scholar 

  8. TIA/EIA Standard IS-54B, Telecommunications Industry Association, Vienna VA., USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. QUALCOMM Australia, Suite 410, Birkenhead Point, 2137, Drummoyne, NSW, Australia

    Greg Rose

Authors
  1. Greg Rose
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd Ed Dawson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rose, G. (1998). A stream cipher based on linear feedback over GF(28). In: Boyd, C., Dawson, E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053728

Download citation

  • DOI: https://doi.org/10.1007/BFb0053728

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64732-4

  • Online ISBN: 978-3-540-69101-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation