Collision-Free Hash Function

A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if

1. It is a one-way hash function.

2. It is hard to find two distinct messages (M^',M) that hash to the same result H(M^')=H(M). More precisely, any efficient algorithm (solving a P-problem) succeeds in finding such a collision with negligible probability (Russell 1992).

See also

Hash Function

Explore with Wolfram|Alpha


Bakhtiari, S.; Safavi-Naini, R.; and Pieprzyk, J. Cryptographic Hash Functions: A Survey. Technical Report 95-09, Department of Computer Science, University of Wollongong, July 1995., A. "Necessary and Sufficient Conditions for Collision-Free Hashing." In Abstracts of Crypto 92. pp. 10-22-10-27, 1992.

Referenced on Wolfram|Alpha

Collision-Free Hash Function

Cite this as:

Weisstein, Eric W. "Collision-Free Hash Function." From MathWorld--A Wolfram Web Resource.

Subject classifications