Skip to main content
SpringerLink
Log in
Book cover

International Workshop on the Theory and Application of Cryptographic Techniques

AUSCRYPT 1992: Advances in Cryptology — AUSCRYPT '92 pp 357–363Cite as

Construction of m-ary de Bruijn sequences (extended abstract)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 718))

Abstract

A new method for constructing large numbers of m-ary de Bruijn sequences is given.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Z.D. Dai, “On the Construction and Cryptographic Application of de Bruijn Sequences”, Presented at Crypt'88, 1988.

    Google Scholar 

  2. Division of Algebra in the Institute of Mathematics, Department of Mathematics of the University of Science and Technology of China, “On Methods of Constructing Feedback Functions of M-Sequences”, ACTA MATHEMATICAE APPLICATAE SINICA, Nov., 1977

    Google Scholar 

  3. T. Etzion, “An Algorithm for Constructing m-ary de Bruijn sequences”, Journal of Algorithms, Vol. 7, 1986, pp. 331–340.

    Google Scholar 

  4. T. Etzion and A. Lempel, “Algorithm for the generation of full length shift-register sequences”, IEEE Tras. Inform. Theory IT-30(1984), pp. 480–484.

    Google Scholar 

  5. H.M. Fredricksen, “A Survey of Full Length Nonlinear Shift Register Cycle Algorithms”, SIAM REVIEW, Vol. 24, No. 2, 1982

    Google Scholar 

  6. H.M. Fredricksen and I.J. Kessler, ”Lexicographic compositions and de Bruijn sequences”, J. Combin Theory 22(1977), pp.17–30

    Google Scholar 

  7. H.M. Fredricksen and J. Maiorana, “Necklaces of beads in k colors and k-ary Bruijn sequences”, Discrete Math. 23(1978), pp.207–210.

    Google Scholar 

  8. C. Larry, W. Doug, ”Embedded de Bruijn sequences”, Proceedings of the 17th Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, Fla. 1986).

    Google Scholar 

  9. A. Ralston, “A New memoryless algorithm for de Bruijn sequences”, J. Algorithm 2(1981).

    Google Scholar 

  10. Z.X. Wan, Z.D. Dai, X.L. Feng, M.L. Liu, “Nonlinear Shift Register Sequences”, Science Press, 1978.

    Google Scholar 

  11. S. Xie, “Notes on de Bruijn sequences”, Discrete Mathematics, 16, 1987, pp. 157–177.

    Google Scholar 

  12. R.H. Xiong, “Theories and Algorithms for generating q-ary de Bruijn sequences”, Scientia Sinica, A, No.11, 1988, pp. 1386–1397.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center, Academia Sinica, 100080, Beijing, China

    Jun-Hui Yang

  2. State Key Laboratory of Information Security, Academia Sinica, 100039-08, Beijing, China

    Jun-Hui Yang & Zong-Duo Dai

Authors
  1. Jun-Hui Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zong-Duo Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jennifer Seberry Yuliang Zheng

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, JH., Dai, ZD. (1993). Construction of m-ary de Bruijn sequences (extended abstract). In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-57220-1_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57220-6

  • Online ISBN: 978-3-540-47976-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation