Advertisement

Cryptanalysis of the SEAL 3.0 Pseudorandom Function Family

  • Scott R. Fluhrer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2355)

Abstract

We present an attack on the SEAL Pseudorandom Function Family that is able to efficiently distinguish it from a truly random function with 243 bytes output. While this is not a practical attack on any use of SEAL, it does demonstrate that SEAL does not achieve its design goals.

References

  1. 1.
    Blahut, R., “Principles and Practice of Information Theory”, Addison-Wesley, 1983.Google Scholar
  2. 2.
    O. Goldreich, S. Goldwasser, S. Micali, “How to construct random functions”, Journal of the ACM, Vol 33, No. 4, 1986, pp. 210–217CrossRefMathSciNetGoogle Scholar
  3. 3.
    H. Handschuh, H. Gilbert, “Χ2 cryptanalysis of the SEAL encryption algorithm”, Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1267, Springer-Verlag, 1997, pp. 1–12CrossRefGoogle Scholar
  4. 4.
    A. Menezes, P. van Oorschot, S. Vanstone, “Handbook of applied cryptography”, CRC Press, 1997Google Scholar
  5. 5.
    P. Rogaway, D. Coppersmith, “A software-optimized encryption algorithm”, Fast Software Encryption, Lecture Notes in Computer Science, Vol 809, Springer-Verlag, pp. 56–63.Google Scholar
  6. 6.
    P. Rogaway, D. Coppersmith, “A software-optimized encryption algorithm”, Journal of Cryptography, Vol. 11, No. 4, 1998, pp. 273–287zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Scott R. Fluhrer
    • 1
  1. 1.Cisco Systems, Inc.San Jose

Personalised recommendations