Skip to main content
SpringerLink
Log in

Stream Ciphers and Correlation

  • Chapter
Difference Sets, Sequences and their Correlation Properties

Part of the book series: NATO Science Series ((ASIC,volume 542))

  • 418 Accesses

Abstract

One important area where sequences find application is cryptography. In the modern electronic era information is stored, processed and transmitted encoded as binary sequences. The automated business environment places great value on this information and it is vital that it is protected. This is often best done by cryptographic means and one such method uses bitwise addition of pseudo-random sequences to the encoded information in order to hide its contents.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Beker, H. and Piper, F. (1982) Cipher Systems, Northwood Books, London.

    MATH  Google Scholar 

  • Berlekamp, E.R. (1968) Algebraic Coding Theory, McGraw-Hill, New York.

    MATH  Google Scholar 

  • Beth, T. and Piper, F. (1985) The stop-and-go generator, in T. Beth, N. Cot and I. Ingemarsson (eds.), Advances in Cryptology: Proc. Eurocrypt ‘84,Lecture Notes in Computer Science 219, Springer, Berlin, pp.88–92.

    Google Scholar 

  • Blaser, W. and Heinzmann, P. (1982) New cryptographic device with high security using public key distribution, Proc. IEEE Student Paper Contest 1979–1980, pp.145–53.

    Google Scholar 

  • Brynielsson, L. (1989) A short proof of the Xiao-Massey Lemma, IEEE Trans. Inform. Theory 35, 1344.

    Article  MathSciNet  MATH  Google Scholar 

  • Chepyzhov, V. and Smeets, B. (1991) On a fast correlation attack on certain stream ciphers, in D.W. Davies (ed.), Advances in Cryptology: Eurocrypt ‘81, Lecture Notes in Computer Science 547, Springer, Berlin, pp.176–185.

    Google Scholar 

  • Coppersmith, D. (1984) Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory 30, 587–594.

    Article  MathSciNet  MATH  Google Scholar 

  • Forre, R. (1989) A fast correlation attack on nonlinearly feedforward filtered shift-register sequences, in J.-J. Quisquater and J. Vandewalle (eds.), Advances in Cryptology: Eurocrypt ‘89, Lecture Notes in Computer Science 434, Springer, Berlin, pp.586–595.

    Google Scholar 

  • Gallager, R.G. (1963) Low-Density Parity-Check Codes, MIT Press, Cambridge, Massachusetts.

    Google Scholar 

  • Geffe, P.R. (1973) How to protect data with ciphers that are really hard to break, Electronics 4, 99–101.

    Google Scholar 

  • Golic, J.D. (1989) On the linear complexity of functions of periodic GF(q)-sequences, IEEE Trans. Inform. Theory 35, 69–75.

    Article  MathSciNet  MATH  Google Scholar 

  • Golomb, S.W. (1967) Shift Register Sequences, San Francisco, Holden Day.

    MATH  Google Scholar 

  • Herlestam, T. (1982) On the complexity of functions of linear shift register sequences, presented at IEEE Int. Symp. Info. Theory, Les Arc, France.

    Google Scholar 

  • Herlestam, T. (1986) On functions of linear shift register sequences, in F. Pichler (ed.), Advances in Cryptology: Proc. of Eurocrypt ‘85, Lecture Notes in Computer Science 219, Springer, Berlin, pp.119–129.

    Chapter  Google Scholar 

  • Key, E.L. (1976) An analysis of the structure and complexity of nonlinear binary sequence generators, IEEE Trans. Inform. Theory 22, 732–763.

    Article  MATH  Google Scholar 

  • Massey, J.L. (1969) Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory 15, 122–127.

    Article  MathSciNet  MATH  Google Scholar 

  • Meier, W. and Staffelbach, O. (1989a) Fast correlation attacks on certain stream ciphers, J. Cryptology 1, 159–176.

    Article  MathSciNet  MATH  Google Scholar 

  • Meier, W. and Staffelbach, O. (1989b) Non-linearity criteria for cryptographic functions, in J.-J. Quisquater and J. Vandewalle (eds.), Advances in Cryptology: Eurocrypt ‘89, Lecture Notes in Computer Science 434, Springer, Berlin, pp.549–562.

    Google Scholar 

  • Meier, W. and Staffelbach, O. (1990) Correlation properties of combiners with memory in stream ciphers, in I. Damgard (ed.), Advances in Cryptology - Eurocrypt ‘80 Lecture Notes in Computer Science 473, Springer, Berlin, pp.204–213.

    Google Scholar 

  • Menezes, A.J., van Oorschot, P.C. and Vanstone, S.A. (1997) Handbook of Applied Cryptography, CRC Press, New York.

    MATH  Google Scholar 

  • Robshaw, M. (1995) Stream Ciphers, RSA Labs Tech. Report TR-701.

    Google Scholar 

  • Rueppel, R.A. (1986a) Analysis and Design of Stream Ciphers, Berlin, Springer-Verlag.

    Book  MATH  Google Scholar 

  • Rueppel, R.A. (1986b) Correlation immunity and the summation generator, in H.C. Williams (ed.), Advances in Cryptology - Crypto’85, Lecture Notes in Computer Sci-ence 218, Springer, Berlin, pp.260–272.

    Google Scholar 

  • Rueppel, R.A. (1991) Stream Ciphers, in Simmons, G.J. (ed.), in Contemporary Cryptology - The Science of Information Integrity, IEEE Press, pp.65–134.

    Google Scholar 

  • Rueppel, R.A. and Staffelbach, O. (1987) Products of sequences with maximum linear complexity, IEEE Trans. Inform. Theory 33, 124–131.

    Article  MATH  Google Scholar 

  • Shannon, C.E. (1949) Communication theory of secrecy systems, Bell Syst. Tech. J. 28, 656–715.

    MathSciNet  MATH  Google Scholar 

  • Siegenthaler, T. (1984) Correlation-immunity of nonlinear combining functions for cryptographic applications, IEEE Trans. Inform. Theory 30, 776–780.

    Article  MathSciNet  MATH  Google Scholar 

  • Siegenthaler, T. (1985a) Decrypting a class of stream ciphers using ciphertext onlyIEEE Trans. Comp. C-34, 81–85.

    Article  Google Scholar 

  • Siegenthaler, T. (1985b) Design of combiners to prevent divide and conquer attacks, in H.C. Williams (ed.), Advances in Cryptology - Crypto’85, Lecture Notes in Computer Science 218, Springer, Berlin, pp.273–279.

    Google Scholar 

  • Siegenthaler, T. (1986) Cryptanalyst’s representation of nonlinearly filtered ML-sequences, in F. Pilcher (ed.), Advances in Cryptology - Eurocrypt ‘85, Lecture Notes in Computer Science 219, Springer, Berlin, pp.103–110.

    Chapter  Google Scholar 

  • Simmons, G.J. (1991) Contemporary Cryptology - The Science of Information Integrity, IEEE Press, New York.

    Google Scholar 

  • Vernam, G.S. (1926) Cipher printing telegraph systems for secret wire and radio telegraphic communications, J. Amer. Inst. Elec. Eng. 45, 109–115.

    Google Scholar 

  • Wolfmann, J. (1999) Bent fuctions and coding theory, this volume.

    Google Scholar 

  • Xiao, G.Z. and Massey, J.L. (1988) A spectral characterization of correlation-immune functions, IEEE Trans. Inform. Theory 34, 569–571.

    Article  MathSciNet  MATH  Google Scholar 

  • Zeng, K. and Huang, M. (1990) On the linear syndrome method in cryptanalysis, in S. Goldwasser (ed.), Advances in Cryptology, Proc. of Crypto ‘88, Lecture Notes in Computer Science 403, Springer, Berlin, pp.469–478.

    Google Scholar 

  • Zeng, K., Yang, C.H. and Rao, T.R.N. (1991) An improved linear syndrome algorithm in cryptanalysis with applications, in A.J. Menezes and S.A. Vanstone (eds.), Advances in Cryptology, Proc. of Crypto ‘80, Lecture Notes in Computer Science 537, Springer, Berlin, pp.34–47.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Royal Holloway, University of London, Egham, Surrey, TW20 0EX, UK

    K. Brincat, F. C. Piper & P. R. Wild

Authors
  1. K. Brincat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. C. Piper
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. R. Wild
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Otto-von-Guericke-Universität, Magdeburg, Germany

    A. Pott

  2. University of Southern California, Los Angeles, USA

    P. V. Kumar

  3. University of Bergen, Norway

    T. Helleseth

  4. University of Augsburg, Germany

    D. Jungnickel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Brincat, K., Piper, F.C., Wild, P.R. (1999). Stream Ciphers and Correlation. In: Pott, A., Kumar, P.V., Helleseth, T., Jungnickel, D. (eds) Difference Sets, Sequences and their Correlation Properties. NATO Science Series, vol 542. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4459-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4459-9_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-7923-5959-3

  • Online ISBN: 978-94-011-4459-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation