Advertisement

The Shrinking Generator: some practical considerations

  • Hugo Krawczyk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 809)

References

  1. 1.
    Coppersmith D., Krawczyk, H., and Mansour Y., “The Shrinking Generator”, presented at Crypto'93.Google Scholar
  2. 2.
    S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982.Google Scholar
  3. 3.
    John A Gordon, “Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field”, Electronics Letters Vol. 12, 1976, pp. 663–664.Google Scholar
  4. 4.
    Rabin, M.O., “Probabilistic Algorithms in Finite Fields”, SIAM J. on Computing, Vol. 9, 1980, pp. 273–280.Google Scholar
  5. 5.
    Rabin, M.O., “Fingerprinting by Random Polynomials”, Tech. Rep. TR-15–81, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Hugo Krawczyk
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown Heights

Personalised recommendations