Abstract
Let s = (s 1, s 2, . . ., s n) be a sequence of characters where s i ∈ Z p for 1 ≤ i ≤ n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s [17, 18]. We provide a proof that the expected length of the shortest feedback register to generate a sequence of length n is less than 2 logp n + o(1), and also give several other statistics of interest for distinguishing random strings. The proof is based on relating the maximum order complexity to a data structure known as a suffix tree.
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
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.
A. Apostolico and W. Szpankowski. Self-alignments in words and their applications. Technical Report CDS-TR-732, Purdue University, 1987.
R. Arratia, L. Gordon, and M. Waterman. An extreme value theory for sequence matching. The Annals of Statistics, 14(3):971–993, 1986.
H. Beker and F. Piper. Cipher Systems. Wiley, 1982.
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R McConnell. Linear size finite automata for the set of all subwords of a word: outline of results. Bulletin of the European Association of Theoretical Computer Science, 21:12–20, 1983.
A. Blumer, E. Ehrenfeucht, and D. Haussler. Average sizes of suffix trees and DAWGs. Discrete Applied Mathemetics, 24:37–45, 1989.
A. Chan and R. Games. On the quadratic spans of periodic sequences. IEEE Transactions on Information Theory, IT-36(4):822–829, 1990.
N. G. de Bruijn. A combinatorial problem. Nederl. Akad. Wetensch. Proc, 49:754–758, 1946.
D. E. R. Denning. Cryptography and Data Security. Addison-Wesley Publishing Company, 1982.
L. Devroye. A probabilistic analysis of the height of tries and of the complexity if triesort. Acta Informatica, 21:229–232, 1984.
S. Golumb. Shift Register Sequences. Aegean Park Press, 1982.
G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, Second Edition, 1991.
E. J. Growth. Generation of binary sequences with controllable complexity. IEEE Transactions on Information Theory, 17(3):288–296, 1971.
H. Gustafson, E. Dawson, and W. Caellie. Comparison of block ciphers. Advances in Cryptology, AUSTCRYPT 90, Lecture Notes in Computer Science, vol. 453, J. Seberry and J. Piepryzk eds., Springer-Verlag, pages 208–220, 1990.
J. Hopcroft and J. Ullman. An introduction to automata, languages and computation. Addison-Wesley Publishing Company, 1979.
P. Jacquet and W. Szpankowski. Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach. preprint, 1990.
C. J. A. Jansen. Investigations on Nonlinear Streamcipher systems: Construction and Evaluation methods. PhD thesis, Philips, USFA BV, 1989.
C. J. A. Jansen and D. Boekee. The shortest feedbck shift register that can generate a sequence. Advances in Cryptology, CRYPTO 89, Lecture Notes in Computer Science, vol. 218, G. Brassard, ed., Springer-Verlag, pages 90–99, 1990.
E. L. Key. An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory, 22(6):732–736, 1976.
D. E. Knuth. The Art of Computer Programming: Volume 3, Sorting and Searching. Addsion Wesley, 1973.
D. E. Knuth. The Art of Computer Programming: Volume 2, Seminumerical Algorithms. Addsion Wesley, 1981.
A. N. Kolmogorov. Three approaches to the quantitative definition of definition. Problems in Information Transmission, 1(1):1–7, 1965.
M. Li and P. M. B. Vitanyi. Two decades of applied Kolmogorov complexity. Technical Report CS-R8813, Centre for Mathematics and Computer Science, April, 1988.
J. L. Massey. Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15:122–127, 1969.
U. M Maurer. Asymptotically tight bounds on the number of cycles in generalized de Bruijn-Good graphs. to appear in Discrete Applied Mathematics.
E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262–272, 1976.
M. Regnier. On the average height of trees in digital search and dynamic hashing. Information Processing Letters, 13(2):64–66, 1981.
R. A. Rueppel. Design and Analysis of Stream Ciphers. Springer-Verlag, 1986.
J. Savage. The Complexity of Computing. John Wiley, 1976.
W. Szpankowski. On the analysis of the average height of a digital search tree: another approach. Technical Report CSD-TR-646, Purdue University, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Connor, L., Snider, T. (1993). Suffix trees and string complexity. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive