Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

An Approximate Distribution for the Maximum Order Complexity

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper we give an approximate probability distribution for the maximum order complexity of a random binary sequence. This enables the development of statistical tests based on maximum order complexity for the testing of a binary sequence generator. These tests are analogous to those based on linear complexity.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. D. Carter, Aspects of local linear complexity, PhD thesis, Royal Holloway and Bedford New College, University of London (1989).

  2. E. D. Erdmann, Complexity measures for testing binary keystreams, PhD thesis, Stanford University (1993).

  3. S. W. Golomb, Shift Register Sequences, Holden-Day (1967).

  4. C. J. A. Jansen, Investigations on nonlinear streamcipher systems: Construction and evaluation methods, PhD thesis, Technical University of Delft (1989).

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

    Google Scholar 

  6. U. M. Maurer, Asymptotically-tight bounds on the number of cycles in generalized deBruijn-Good graphs, Discrete Applied Mathematics, Vol. 37,No. 38 (1992) pp. 421–436.

    Google Scholar 

  7. H. Niederreiter, The linear complexity profile and the jump complexity of keystream sequences, Advances in Cryptology: Proceedings of EUROCRYPT 90, Springer-Verlag (1991) pp. 174–188.

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

  9. M. Wang, Cryptographic aspects of sequence complexity measures, PhD thesis, Swiss Federal Institute of Technology (1988).

  10. A. M. Zubkov and V. G. Mikhailov, Limit distributions of random variables associated with long duplications in a sequence of independent trials, Theory of Probability and its Applications, Vol. 19 (1974) pp. 172–179.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Applied Decision Analysis Inc., 2710 Sand Hill Road, Menlo Park, CA, 94025, U.S.A

    Diane Erdmann

  2. Information Security Group, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, U.K

    Sean Murphy

Authors
  1. Diane Erdmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sean Murphy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erdmann, D., Murphy, S. An Approximate Distribution for the Maximum Order Complexity. Designs, Codes and Cryptography 10, 325–339 (1997). https://doi.org/10.1023/A:1008295603824

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008295603824

Search

Navigation