Skip to main content
SpringerLink
Log in

K-M sequence is forwardly predictable

  • 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:

  • 238 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. K. Kurosawa and K. Matsu, Cryptographically secure pseudorandom sequence generator based on reciprocal number cryptosystem, Electron. Lett. Vol. 24, No. 1, pp16–17, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Engineering, Beijing University of Posts and Telecommunication, 100088, Beijing, PRC

    Yang Yi Xian

Authors
  1. Yang Yi Xian
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Xian, Y.Y. (1990). K-M sequence is forwardly predictable. 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/BFb0030349

Download citation

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

  • 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

Search

Navigation