The Classification of Hash Functions

The Classification of Hash Functions (1993)

by Ross Anderson

Citations:

22 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Classification of Hash Functions	SVM HeaderParse 0.1
AUTHOR NAME	Ross Anderson	user correction - Legacy Corrections
ABSTRACT	When we ask what makes a hash function `good', we usually get an answer which includes collision freedom as the main (if not sole) desideratum. However, we show here that given any collision-free function, we can derive others which are also collision-free, but cryptographically useless. This explains why researchers have not managed to find many interesting consequences of this property. We also prove Okamoto's conjecture that correlation freedom is strictly stronger than collision freedom. We go on to show that there are actually rather many properties which hash functions may need. Hash functions for use with RSA must be multiplication free, in the sense that one cannot find X , Y and Z such that h(X)h(Y ) = h(Z); and more complex requirements hold for other signature schemes. Universal principles can be proposed from which all the freedom properties follow, but like most theoretical principles, they do not seem to give much value to a designer; at the practical level, the main imp...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
CITATIONS	39 found	ParsCit 1.0