A software-optimized encryption algorithm

  • Phillip Rogaway
  • Don Coppersmith
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 809)


We describe a fast, software-oriented, encryption algorithm. Computational cost on a 32-bit processor is about 5 elementary machine instructions per byte of text. The cipher is a pseudorandom function; under control of a key (first pre-processed into an internal table) it stretches a short index into a much longer pseudorandom string. This string can be used as a one-time pad.


  1. 1.
    E. Biham and A. Shamir, Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, 1993.Google Scholar
  2. 2.
    O. Goldreich, S. Goldwasser and S. Micali, “How to construct random functions.” Journal of the ACM, Vol. 33, No. 4, 210–217. 1986.Google Scholar
  3. 3.
    R. Merkle, “Fast software encryption functions.” Proceedings of CRYPTO '91, Springer-Verlag. Also U.S. patent 5,003,597. March 1991.Google Scholar
  4. 4.
    National Bureau of Standards, “Data Encryption Standard.” Federal Information Processing Standards Publication 46. January 1977.Google Scholar
  5. 5.
    National Institute of Standards, FIPS Publication 180, “Secure Hash Standard.” May 1993.Google Scholar
  6. 6.
    RSA Data Security, Inc., promotional materials and personal communications. Redwood City, California.Google Scholar
  7. 7.
    A. Shimizu and S. Miyaguchi, “Fast Data Encryption Algorithm FEAL.” Eurocrypt '87.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Phillip Rogaway
    • 1
  • Don Coppersmith
    • 2
  1. 1.IBM Personal SystemsAustinUSA
  2. 2.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations