An Approximate Distribution for the Maximum Order Complexity

Authors:
Diane Erdmann;Sean Murphy
Affiliations:
Applied Decision Analysis Inc., 2710 Sand Hill Road, Menlo Park, CA 94025, U.S.A.;Information Security Group, Royal Holloway, University of London, Egham, Surrey TW20 0EX, U.K.
Venue:
Designs, Codes and Cryptography
Year:
1997

Citing 5
Cited 3

Analysis and design of stream ciphers

Analysis and design of stream ciphers
The linear complexity profile and the jump complexity of keystream sequences

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Aysmptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs

Discrete Applied Mathematics - Special double volume: interconnection networks
Complexity measures for testing binary keystreams

Complexity measures for testing binary keystreams
Shift Register Sequences

Shift Register Sequences

Composition of recursions and nonlinear complexity of periodic binary sequences

Designs, Codes and Cryptography
Nonlinear complexity of binary sequences and connections with lempel-ziv compression

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the classification of periodic binary sequences into nonlinear complexity classes

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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