Advertisement

A fast new DES implementation in software

  • Eli Biham
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1267)

Abstract

In this paper we describe a fast new DES implementation. This implementation is about five times faster than the fastest known DES implementation on a (64-bit) Alpha computer, and about three times faster than than our new optimized DES implementation on 64-bit computers. This implementation uses a non-standard representation, and view the processor as a SIMD computer, i.e., as 64 parallel one-bit processors computing the same instruction. We also discuss the application of this implementation to other ciphers. We describe a new optimized standard implementation of DES on 64-bit processors, which is about twice faster than the fastest known standard DES implementation on the same processor. Our implementations can also be used for fast exhaustive search in software, which can find a key in only a few days or a few weeks on existing parallel computers and computer networks.

References

  1. 1.
    H. Feistel, Cryptography and Data Security, Scientific American, Vol. 228, No. 5, pp. 15–23, May 1973.CrossRefGoogle Scholar
  2. 2.
    James L. Massey, SAFER-K64: A Byte Oriented Block Ciphering Algorithm, proceedings of Fast Software Encryption, Cambridge, Lecture Notes in Computer Science, pp. 1–17, 1993.Google Scholar
  3. 3.
    Ralph C. Merkle, Fast Software Encryption Functions, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’90, pp. 476–501, 1990.Google Scholar
  4. 4.
    National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS pub. 46, January 1977.Google Scholar
  5. 5.
    National Institute of Standard Technology, Secure Hash Standard, U.S. Department of Commerce, FIPS pub. 180, May 1993.Google Scholar
  6. 6.
    National Institute of Standard Technology, Secure Hash Standard, U.S. Department of Commerce, FIPS pub. 180-1, April 1995.Google Scholar
  7. 7.
    Ronald L. Rivest, The MD4 Message Digest Algorithm, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’90, pp. 303–311, 1990.Google Scholar
  8. 8.
    Ronald L. Rivest, The MD5 Message Digest Algorithm, Internet Request for Comments, RFC 1321, April 1992.Google Scholar
  9. 9.
    Michael Roe, Performence of Block Ciphers and Hash Functions — One Year Later, proceedings of Fast Software Encryption, Leuven, Lecture Notes in Computer Science, pp. 359–362, 1994.Google Scholar
  10. 10.
    Bruce Schneier, Applied Cryptography, Protocols, Algorithms, and Source Code in C, second edition, John Willey & Sons, 1996.Google Scholar
  11. 11.
    Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT’87, pp. 267–278, 1987.Google Scholar
  12. 12.
    Arthur Sorkin, Lucifer, a Cryptographic Algorithm, Cryptologia, Vol. 8, No. 1, pp. 22–41, January 1984.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Eli Biham
    • 1
  1. 1.Computer Science DepartmentTechnion - Israel Institute of TechnologyHaifaIsrael

Personalised recommendations