Skip to main content
SpringerLink
Log in

A note on nonuniform decimation of periodic sequences

  • Conference paper
  • First Online:
Cryptography: Policy and Algorithms (CPA 1995)

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

Included in the following conference series:

Abstract

Periods of interleaved and nonuniformly decimated integer sequences are investigated. A characterization of the period of an interleaved sequence in terms of the constituent periodic integer sequences is first derived. This is then used to generalize the result of Blakley and Purdy on the period of a decimated integer sequence obtained by a periodic nonuniform decimation. The developed technique may be interesting for analyzing the period of various pseudorandom sequences, especially in stream cipher applications.

This research was supported in part by the Science Fund of Serbia, grant #0403, through the Institute of Mathematics, Serbian Academy of Arts and Sciences.

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. G. R. Blakley and G. B. Purdy. ”A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines.” Information Sciences 24 (1981): 71–91.

    Google Scholar 

  2. W. G. Chambers and S. M. Jennings. ”Linear equivalence of certain BRM shift-register sequences.” Electron. Lett. 20 (1984): 1018–1019.

    Google Scholar 

  3. P. F. Duvall and J. C. Mortick. ”Decimation of periodic sequences.” SIAM J. Appl. Math. 21 (1971): 367–372.

    Google Scholar 

  4. J. Dj. Golić and M. V. Živković. ”On the linear complexity of nonuniformly decimated PN-sequences.” IEEE Trans. Inform. Theory 34 (1988): 1077–1079.

    Google Scholar 

  5. J. Dj. Golić. ”On decimation of linear recurring sequences.” The Fibonacci Quarterly 33 (1995): 407–411.

    Google Scholar 

  6. D. Gollmann and W. G. Chambers. ”Clock-controlled shift registers: a review.” IEEE J. Sel. Ar. Comm. 7 (1989): 525–533.

    Google Scholar 

  7. S. W. Golomb. Shift Register Sequences. Holden-Day, San Francisco, 1967.

    Google Scholar 

  8. G. Gong. ”Theory and applications of q-ary interleaved sequences.” IEEE Trans. Inform. Theory 41 (1995):400–411.

    Google Scholar 

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

    Google Scholar 

  10. N. Zierler. ”Linear recurring sequences.” J. Soc. Indust. Appl. Math. 7 (1959): 31–48.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, GPO Box 2434, Q 4001, Brisbane, Australia

    Jovan Dj. Golić

  2. School of Electrical Engineering, University of Belgrade, Yugoslavia

    Jovan Dj. Golić

Authors
  1. Jovan Dj. Golić
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ed Dawson Jovan Golić

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golić, J.D. (1996). A note on nonuniform decimation of periodic sequences. In: Dawson, E., Golić, J. (eds) Cryptography: Policy and Algorithms. CPA 1995. Lecture Notes in Computer Science, vol 1029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032352

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation