Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Parallel generation of pseudo-random sequences

  • Section 5 Pseudorandomness And Sequences II
  • 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:

Abstract

Nonlinear filtering of the states of LFSR is proposed to generate parallel pseudo-random (PR) sequences. The result of filtering is a set of sequences over GF(2m) called exponent sequences. Each exponent sequence can be regarded as m parallel component sequences. Assessment of the parallel generator is discussed and statistical properties of individual component sequences and their mutual statistical dependence are examined. Upper bounds on the linear equivalence of exponent sequences and their associated component sequences are developed and it is shown that in both cases higher linear complexity can only be achieved in higher exponents. It is noticed that exponents that are prime to 2 m-1 produce sequences of maximum period and their component sequences have small cross correlation (equal to -1) and low statistical dependence. Finally directions for further research are proposed.

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, Berlin, 1986.

    Google Scholar 

  2. Stephen A. Cook, "An Overview of Computational Complexity", CACM, vol. 26, no. 6, pp. 401–408, Jan. 1983.

    Google Scholar 

  3. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, 1986

    Google Scholar 

  4. D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley Publishing Company, 1981

    Google Scholar 

  5. S. Golomb, Shift Register Sequences, Aegean Park Press,1982

    Google Scholar 

  6. F. J. MacWilliams and N. J. Sloane, Theory of Error-Correcting Codes, North-Holland Publishing Company, 1978.

    Google Scholar 

  7. E.S. Selmer, Linear Recurrence Relations over Finite Fields, Department of Mathematics, University of Bergen, Norway, 1966.

    Google Scholar 

  8. R. S. Safavi-Naini, Parallel Genration of Pseudo-Random Sequences, UNSW, University College, ADFA, TR CS89/24

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College, ADFA UNSW, 2600, Canberra, ACT, Australia

    Reihaneh Safavi-Naini

Authors
  1. Reihaneh Safavi-Naini
    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

Safavi-Naini, R. (1990). Parallel generation of pseudo-random 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/BFb0030360

Download citation

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

  • 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