One Way Hash Functions and DES

  • Ralph C. Merkle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 435)


One way hash functions are a major tool in cryptography. DES is the best known and most widely used encryption function in the commercial world today. Generating a one-way hash function which is secure if DES is a “good” block cipher would therefore be useful. We show three such functions which are secure if DES is a good random block cipher.


Hash Function Random Function Security Level Block Cipher Encryption Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.)
    “Secrecy, Authentication, and Public Key Systems”, Stanford Ph.D. thesis, 1979, by Ralph C. Merkle.Google Scholar
  2. 2.)
    “A Certified Digital Signature”, unpublished paper. 1979. To appear in Crypto’ 89.Google Scholar
  3. 3.)
    “Universal One-Way Hash Functions and their Cryptographic Applications”. Moni Naor and Moti Yung. Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington May 15–17. 1989. page 33–43.Google Scholar
  4. 4.)
    “A High Speed Manipulation Detection Code”, by Robert R. Jueneman, Advances in Cryptology-CRYPTO’ 86, Springer Verlag. Lecture Notes on Computer Science, Vol. 263. page 327 to 346.Google Scholar
  5. 5.)
    “Another Birthday Attack” by Don Coppersmith, Advances in Cryptology-CRYPTO’ 85. Springer Verlag, Lecture Notes on Computer Science, Vol. 218, pages 14 to 17.Google Scholar
  6. 6.)
    “A digital signature based on a conventional encryption function”. by Ralph C. Merkle, Advances in Cryptology CRYPTO 87, Springer Verlag, Lecture Notes on Computer Science, Vol. 293. page 369–378.Google Scholar
  7. 7.)
    “Cryptography and Data Security”, by Dorothy E. R. Denning. Addison-Wesley 1982. page 170.Google Scholar
  8. 8.)
    “On the security of multiple encryption”. by Ralph C. Merkle. CACM Vol. 24 No. 7, July 1981 pages 465 to 467.MathSciNetGoogle Scholar
  9. 9.)
    “Results of an initial attempt to cryptanalyze the NBS Data Encryption Standard”. by Martin Hellman et. al., Information Systems lab. report SEL 76-042, Stanford University 1976.Google Scholar
  10. 10.)
    “Communication Theory of Secrecy Systems”, by C. E. Shannon, Bell Sys. Tech. Jour. 28 (Oct. 1949) 656–715MathSciNetGoogle Scholar
  11. 11.)
    “Message Authentication” by R. R. Jueneman. S. M. Matyas, C. H. Meyer, IEEE Communications Magazine, Vol. 23, No. 9. September 1985 pages 29–40.CrossRefGoogle Scholar
  12. 12.)
    “Generating strong one-way functions with cryptographic algorithm”, by S. M. Matyas. C. H. Meyer, and J. Oseas, IBM Technical Disclosure Bulletin, Vol. 27, No. 10A. March 1985 pages 5658–5659Google Scholar
  13. 13.)
    “Analysis of Jueneman’s MDC Scheme”. by Don Coppersmith, preliminary version June 9.1988. Analysis of the system presented in [4].Google Scholar
  14. 14.)
    “The Data Encryption Standard: Past and Future” by M.E. Smid and D.K. Branstad, Proc. of the IEEE, Vol 76 No. 5 pp 550–559, May 1988CrossRefGoogle Scholar
  15. 15.)
    “Defending Secrets, Sharing Data: New Locks and Keys for Electronic Information”, U.S. Congress. Office of Technology Assessment OTA-CIT-310, U.S. Government Printing Office, October 1987Google Scholar
  16. 16.)
    “Exhaustive cryptanalysis of the NBS data encryption standard”. Computer, June 1977. pages 74–78Google Scholar
  17. 17.)
    “Cryptograhy: a new dimension in data security”, by Carl H. Meyer and Stephen M. Matyas, Wiley 1982.Google Scholar
  18. 18.)
    “Secure program code with modification detection code”. by Carl H. Meyer and Michael Schilling; Proceedings of the 5th Worldwide Congress on Computers and Communication Security and Protection — SECURICOM 88. pp. 111–130, SEDEP, 8. Rud de la Michodiese, 75002. Paris, France.Google Scholar
  19. 19.)
    “Cryptography — A State of the Art Review,” by Carl H. Meyer, COMEURO 89. Hamburg, May 8–12, 1989. Proceedings-VLSI and Computer Peripherals, 3rd Annual European Computer Conference, pp. 150–154.Google Scholar
  20. 20.)
    “Design Principles for Hash Functions” by Ivan Damgaard. Crypto’ 89.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Ralph C. Merkle
    • 1
  1. 1.Xerox PARCPalo Alto

Personalised recommendations