Skip to main content

Labyrinth: A new ultra high speed stream cipher

  • Conference paper
  • First Online:
Crytography and Coding (Cryptography and Coding 1997)

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

Included in the following conference series:

  • 116 Accesses

Abstract

We present a new high speed, high security, 32-bit oriented stream cipher. The algorithm was developed for use in very high speed systems, in particular, ATM fibre networks. The design is based on simple, proven components to minimise complexity and allow detailed analysis of the algorithmic security. A complete prototype implementation has been built to high grade equipment standards for use in ATM circuits at data rates up to 1.6 Gbps. We have called the new algorithm “Labyrinth”.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. NBS FIPS Publication 46, Data Encryption Standard, US National Bureau of Standards, US Dept. of Commerce, January 1977.

    Google Scholar 

  2. CRY12C102 DES CHIP”, Data sheet, Lintel NV/SA, Belgium.

    Google Scholar 

  3. The wench Proposal for the Cipher”, Racal Internal Document No. 10-1617-01, 10 June 1988, (private communication).

    Google Scholar 

  4. Secure Rambutan Kernel”, Marconi Electronic Devices Ltd, 1989, (private communication).

    Google Scholar 

  5. P. Rogaway and D. Coppersmith, “A Software-Optimised Encryption Algorithm”, Proc. Cambridge Security Workshop on Fast Software Encryption, Lecture Notes in Computer Science 809, Springer Verlag, Berlin, 1994, ISBN 0-387-58108-1, 56–63.

    Google Scholar 

  6. G. Marsaglia, “A current view of random number generators”, Keynote address in Proceedings of 16th Symposium on Computer and Statistics, Elsevier, 1985.

    Google Scholar 

  7. D. E. Knuth, “The Art of Computer Programming”, Volume 3, Section 6.7, Addison-Wesley, Reading, MA, 1981.

    Google Scholar 

  8. S. N. Blackler and S. J. Shepherd, “Characterization of Non-linearity in Block Ciphers”, selected paper in Communications Coding and Signal Processing, eds. Honary, Darnell and Farrell, John Wiley & Sons, Chichester, 1997, ISBN 0-47197821-3, 233–247.

    Google Scholar 

  9. S. J. Shepherd and S. K. Barton, “On the Decomposition of Mixed Shift Register Sequences”, to appear.

    Google Scholar 

  10. T. Siegenthaler, “Decrypting a Class of Stream Ciphers Using Ciphertext Only”, IEEE Transactions on Computers, 34 (1), January 1985, 81–85.

    Google Scholar 

  11. R. Rueppel, “Design and Analysis of Stream Ciphers”, Springer Verlag, 1986, ISBN 0-387-16870-2.

    Google Scholar 

  12. J. Golic, “Linear Models for Keystream Generators”, IEEE Transactions on Computers, 45 (1), January 1996, 41–49.

    Article  Google Scholar 

  13. J. L. Massey, “Shift Register Synthesis and BCH Decoding”, IEEE Transactions on Information Theory, 15, January 1969, 122–127.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michael Darnell

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, B., Shepherd, S. (1997). Labyrinth: A new ultra high speed stream cipher. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024464

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63927-5

  • Online ISBN: 978-3-540-69668-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics