Skip to main content
SpringerLink
Log in

Universal logic sequences

  • Section 11 Rump Session
  • Conference paper
  • First Online:
Advances in Cryptology — AUSCRYPT '90 (AUSCRYPT 1990)

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

Included in the following conference series:

  • 222 Accesses

Abstract

A sequence defined to be a generalised multiplexed sequence using several linear feedback shift registers (LFSR) to select from the stages of another LFSR can be shown to be zero-order correlation immune. By introducing one bit of memory it is shown how one can use a generalised multiplexed sequence in the construction of a sequence which is correlation immune. This new sequence is classified as a universal logic sequence. Several properties of universal logic sequences will be developed and empirical results on other properties will be given based on the results of simulation.

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. R.A. Rueppel, "Analysis and Design of Stream Ciphers", Springer-Verlag, 1986.

    Google Scholar 

  2. M. Liu and Z. Wan, "Generalised Multiplexed Sequences", Advances in Cryptology, Eurocrypt 85, pp. 135–141.

    Google Scholar 

  3. T. Siegenthaler, "Decrypting a Class of Stream Ciphers Using Ciphertext Only", IEEE Trans. Comp., Vol. C-34, No. 1, 1985, pp. 81–85.

    Google Scholar 

  4. S. Mund, D. Gollmann, T. Beth, "Some Remarks on the Cross Correlation Analysis of Pseudo Random Generators", Advances in Cryptology, Eurocrypt 87, pp. 25–33.

    Google Scholar 

  5. S.M. Jennings, "A special class of binary sequences", Ph.D. thesis, University of London, 1980.

    Google Scholar 

  6. J.L. Massey, "Shift register sequences and BCH decoding,", IEEE Trans. on Inform. Theory, Vol. IT-15, Jan. 1969, pp. 122–127.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Queensland University of Technology, GPO Box 2434, Q 4001, Brisbane

    Ed Dawson

  2. School of Electrical and Electronic Systems Engineering, Queensland University of Technology, GPO Box 2434, Q 4001, Brisbane

    Bruce Goldburg

Authors
  1. Ed Dawson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruce Goldburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jennifer Seberry Josef Pieprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dawson, E., Goldburg, B. (1990). Universal logic sequences. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030381

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53000-8

  • Online ISBN: 978-3-540-46297-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation