Abstract
In this paper we extend the theory of maximum order complexity from a single sequence to an ensemble of sequences. In particular, the maximum order complexity of an ensemble of sequences is defined and its properties discussed. Also, an algorithm is given to determine the maximum order complexity of an ensemble of sequences linear in time and memory. It is also shown how to determine the maximum order feedback shift register equivalent of a given ensmble of sequences, i.e. including a feedback function. Hence, the problem of finding the absolutely shortest (possibly nonlinear) feedback shift register, that can generate two or more given sequences with characters from some arbitrary finite alphabet, is solved. Finally, the consequences for sequence prediction based on the minimum number of observations are discussed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Arratia and M. S. Waterman. “Critical Phenomena in Sequence Matching”, The Annals of Probability, vol. 13, no. 4, pp. 1236–1249, 1985.
R. Arratia and M. S. Waterman. “An Erdös-Rényi Law with Shifts”, Adv. in Math., vol. 55, pp. 13–23, 1985.
R. Arratia, L. Gordon and M. S. Waterman. “An Extreme Value Theory for Sequence Matching”, The Annals of Statistics, vol. 14, no. 3, pp. 971–993, 1986.
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnell. “Linear Size Finite Automata for the Set of all Subwords of a Word: An Outline of Results”, Bul. Eur. Assoc. Theor. Comp. Sci., no. 21, pp. 12–20, 1983.
A. Blumer, J. Blumer, D. Haussler, R. McConnell and A. Ehrenfeucht. “Complete Inverted Files for Efficient Text Retrieval and Analysis”, JACM, vol. 34, no. 3, pp. 578–595, July 1987.
H. Fredricksen. “A survey of full-length nonlinear shift register cycle algorithms”, SIAM Rev., vol. 24, pp. 195–221, April 1982.
C. J. A. Jansen and D. E. Boekee. “The Algebraic Normal Form of Arbitrary Functions of Finite Fields”, Proceedings of the Eighth Symposium on Information Theory in the Benelux, Deventer, The Netherlands, pp. 69–76, May 1987.
C. J. A. Jansen. Investigations On Nonlinear Streamcipher Systems: Construction and Evaluation Methods, PhD. Thesis, Technical University of Delft, Delft, 1989.
C. J. A. Jansen and D. E. Boekee. “The Shortest Feedback Shift Register That Can Generate A Given Sequence”, Proceedings of Crypto’ 89, Santa Barbara, USA.
C. J. A. Jansen and D. E. Boekee. “On the Significance of the Directed Acyclic Word Graph in Cryptology”, Proceedings of Auscrypt’ 90, Sydney, Australia.
C. J. A. Jansen “On the Construction of Run Permuted Sequences”, proceedings of Eurocrypt’ 90, Århus, Denmark.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, C.J.A. (1991). The Maximum Order Complexity of Sequence Ensembles. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive