Skip to main content
SpringerLink
Log in

Revealing information with partial period correlations (extended abstract)

  • Conference paper
  • First Online:
Book cover Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

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

Included in the following conference series:

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bauer, Probability Theory and Elements of Measure Theory, Holt, Rinehart and Winston, New York, 1972.

    Google Scholar 

  2. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM Jo. Comput.13 (1984), 850–864.

    Article  Google Scholar 

  3. L. Brynielsson, On the Linear Complexity of Combined Shift Registers, em in “Proceedings of Eurocrypt 1984,” pp. 156–160.

    Google Scholar 

  4. A. H. Chan And R. Games, On the linear span of binary sequences from finite geometries, q odd, in “Proceedings of Crypto 1986,” pp. 405–417, Santa Barbara.

    Google Scholar 

  5. A. H. Chan, M. Goresky, And A. Klapper, Cross-correlations of geometric sequences and GMW sequences, in Proceedings of Marshall Hall Memorial Conference, Burlington, VT, 1990 and Northeastern University Technical Report NU-CCS-90-12.

    Google Scholar 

  6. S. Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, 1982.

    Google Scholar 

  7. R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics vol. 20, Cambridge University Press, Cambridge, 1983.

    Google Scholar 

  8. J.L. Massey, Shift register sequences and BCH decoding, IEEE Trans. Info. Thy., IT-15 (1969), pp. 122–127.

    Article  Google Scholar 

  9. R. McEliece, Finite Fields for Computer Scientists and Engineers, Kluwer Academic Publishers, Boston, 1987.

    Google Scholar 

  10. M. Simon, J. Omura, R. Schultz, And B. Levitt, Spread-Spectrum Communications, Vol. 1, Computer Science Press, 1985.

    Google Scholar 

  11. D. Welsh, Codes and Cryptography, Clarendon Press, Oxford, 1988.

    Google Scholar 

  12. A. Yao, Theory and applications of trapdoor functions, in “Proc. 23rd IEEE Symp. on Foundations of Comp. Sci.,” 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Northeastern University, 02115, Boston, MA, USA

    Andrew Klapper & Mark Goresky

Authors
  1. Andrew Klapper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Goresky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klapper, A., Goresky, M. (1993). Revealing information with partial period correlations (extended abstract). In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation