A fast software one-way hash function

  title={A fast software one-way hash function},
  author={Ralph C. Merkle},
  journal={Journal of Cryptology},
  • R. Merkle
  • Published 1 December 1990
  • Computer Science, Mathematics
  • Journal of Cryptology
One way hash functions are an important cryptographic primitive, and can be used to solve a wide variety of problems involving authentication and integrity. It would be useful to adopt a standard one-way hash function for use in a wide variety of systems throughout the world. Such a standard one-way hash function should be easy to implement, use, and understand; resistant to cryptographic attack, and should be fast when implemented in software. We present a candidate one-way hash function which… 


This paper sketches the history of the concept, discusses the applications of hash functions, and presents the approaches which have been followed to construct hash functions.

Cryptographic Hash Functions

This paper presents the design principles of the popular Merkle–Damgard construction, which are followed in almost all widely used standard hash functions such as MD5 and SHA-1.


A new cryptographic keyed hash function design, named Concrete Hash function Algorithm, CHA-128, which has some difference from the popular hash function designs and used for ensuring integrity of messages to a higher degree to suit the fast growing network applications.

Contributions to the theory and application of cryptographic hash functions

This Thesis revisits the theory and application of cryptographic hash functions, and provides new contributions to this field, which has been explored for over three decades, yet remains a highly active and interesting area of research.

Cryptanalysis of SHA-0 and Reduced SHA-1

This work uses new techniques for the cryptanalysis of hash functions to find a collision of the full SHA-0 which is the first published collision of this function, and very efficient collision attacks on reduced versions of SHA-1.

The State of Hash Functions and the NIST SHA-3 Competition

  • B. Preneel
  • Computer Science, Mathematics
  • 2008
This extended abstract presents a brief outline of the state of the art of hash functions at the beginning of the SHA-3 competition and tries to clarify the context in which this competition is starting.

Universal One Way Hash Functions ( UOWHF )

The importance of hash functions, its various structures, design techniques, attacks and the progressive recent development in this field are brought out.

A one-way function based on norm form equations

It is proved that this function is collision resistant, so it can be used as a one- way hash function, and it is shown that this construction probably provides a family of one-way functions.

Construction of secure and fast hash functions using nonbinary error-correcting codes

It is proved that the new hash functions are collision resistant under reasonable assumptions about the underlying compression function and/or block cipher, and a lower bound is shown on the number of operations to find a collision as a function of the strength of the underlying compressed function.

required for a generalized version of the MD 6 hashing mode to be secure

This work provides three simple proofs, one per primitive type, that cover all modes where the input to the primitive consists of message bits, chaining value bits, and bits that only depend on the mode and message length.



Universal one-way hash functions and their cryptographic applications

A Universal One-Way Hash Function family is defined, a new primitive which enables the compression of elements in the function domain and it is proved constructively that universal one- way hash functions exist if any 1-1 one-way functions exist.

A High Speed Manipulation Detection Code

A revised 128-bit MDC algorithm is presented which overcomes the so-called Triple Birthday Attck introduced by Coppersmith and makes use of the Intel 8087/80287 Numeric Data Processor coprocessor chip for the IBM PC/XT/AT and similar microcomputers.

Message authentication

In the last chapter, we discussed the data integrity threats and the use of hashing technique to detect if any modification attacks have taken place on the data. Another type of threat that exist for

Cryptography and Data Security

The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.

Data Encryption Standard: past and future

The authors examine the past and future of the Data Encryption Standard (DES), which is the first, and to the present date, only, publicly available cryptographic algorithm that has been endorsed by

Communication theory of secrecy systems

  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and cataloging individual pieces of data to provide real-time information about their owners.

Advances in Cryptology — CRYPTO ’87

  • C. Pomerance
  • Computer Science
    Lecture Notes in Computer Science
  • 2000

On the security of multiple encryption

It is shown that although either technique significantly improves security over single encryption, the new technique does not significantly increase security over simple double encryption.