Alternating Step Generators Controlled by De Bruijn Sequences
 C. G. Günther
 … show all 1 hide
Abstract
The alternating step generator (ASG) is a new generator of pseudorandom sequences which is closely related to the stopandgo generator. It shares all the good properties of this latter generator without Posessing its weaknesses. The ASG consists of three subgenerators k, m, and . The main characteristic of its structure is that the output of one of the subgenerators, k, controls the clock of the two others, m and . In the present contribution, we determine the period, the distribution of short patterns and a lower bound for the linear complexity of the sequences generated by an ASG. The proof of the lower bound is greatly simplified by assuming that k generates a de Bruijn sequence. Under this and other not very restrictive assumptions the period and the linear complexity are found to be proportional to the period of the de Bruijn sequence. Furthermore the frequency of all short patterns as well as the autocorrelations turn out to be ideal. This means that the sequences generated by the ASG are provably secure against the standard attacks.
 S.A. Tretter, “Properties of PN^{2} sequences”, IEEE Trans. Inform. Theory, vol. IT20, pp. 295–297, March 1974. CrossRef
 K. Kjeldsen and E. Andresen, “Some randomness properties of cascaded sequences”, IEEE Trans. Inform. Theory, vol. IT26, pp. 227–232, March 1980. CrossRef
 T. Beth and F. Piper, “The stopandgogenerator”, in Proc. of EUROCRYPT 84, Springer Lect. Notes in Comp. Science, vol. 209, pp. 88–92.
 R. Vogel, “On the linear complexity of cascaded sequences”, in Proc. of EUROCRYPT 84, Springer Lect. Notes in Comp. Science, vol. 209, pp. 99–109.
 D. Gollman, “Pseudo random properties of cascade connections of clock controlled shift registers”, in Proc. of EUROCRYPT 84, Springer Lect. Notes in Comp. Science, vol. 209, pp. 93–98.
 W.G. Chambers and S.M. Jennings, “Linear equivalence of certain BRM shiftregister sequences”, Electronics Letters, vol. 20, pp. 1018–1019, Nov. 1984. CrossRef
 N.G. de Bruijn, “A combinatorial problem”, Proc. K. Ned. Akad. Wet., vol. 49, pp 758–764, 1946.
 C.G. Günther, “Alternating step generators”, submitted to IEEE Trans, on Inform. Theory.
 T. Siegenthaler, “Correlationimmunity of nonlinear combining functions for cryptographic applications”, IEEE Trans, on Inform. Theory, vol. IT30, pp. 776–780, Sept. 1984. CrossRef
 N. Zierler, “Linear recurring sequences”, J. Soc. Indust. Appl. Math., vol. 7, pp. 31–48, March 1959. CrossRef
 E.S. Selmer, Linear Recurrence Relations Over Finite Fields, Department of Mathematics, University of Bergen, Norway 1966.
 A.H. Chan, R.A. Games and E.L. Key, “On the complexities of de Bruijn sequences”, J. of Comb. Theory, Series A, vol. 33, pp. 233–246, 1982. CrossRef
 Title
 Alternating Step Generators Controlled by De Bruijn Sequences
 Book Title
 Advances in Cryptology — EUROCRYPT’ 87
 Book Subtitle
 Workshop on the Theory and Application of Cryptographic Techniques Amsterdam, The Netherlands, April 13–15, 1987 Proceedings
 Book Part
 Section I:
 Pages
 pp 514
 Copyright
 1988
 DOI
 10.1007/3540391185_2
 Print ISBN
 9783540191025
 Online ISBN
 9783540391180
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 304
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 David Chaum ^{(1)}
 Wyn L. Price ^{(2)}
 Editor Affiliations

 1. Centre for Mathematics and Computer Science (CWI)
 2. National Physical Laboratory
 Authors

 C. G. Günther ^{(3)}
 Author Affiliations

 3. Brown Boveri Research Center, 5405, Baden, Switzerland
Continue reading...
To view the rest of this content please follow the download PDF link above.