Skip to main content

Continued fractions and the Berlekamp-Massey algorithm

  • Section 2 Pseudorandomness And Sequences I
  • Conference paper
  • First Online:
Advances in Cryptology — AUSCRYPT '90 (AUSCRYPT 1990)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. W. Cassels, Diophantine Approximation, Cambridge University Press, London, 1965.

    Google Scholar 

  2. J. L. Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Trans. Info. Th., Vol. IT-15, pp. 122–127, Jan. 1969.

    Google Scholar 

  3. W.H. Mills, “Continued Fractions and Linear Recurrence”, Math. Comp., 29(1975), pp. 173–180.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jennifer Seberry Josef Pieprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dai, Z., Zeng, K. (1990). Continued fractions and the Berlekamp-Massey algorithm. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030347

Download citation

  • DOI: https://doi.org/10.1007/BFb0030347

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53000-8

  • Online ISBN: 978-3-540-46297-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics