On the Indifferentiability of the Integrated-Key Hash Functions

Most of today's popular hash functions are keyless such that they accept variable-length messages and return fixed-length fingerprints. However, recent separation results reported on several serious inherent weaknesses in these functions, motivating the design of hash functions in the keyed setting. The challenge in this case, however, is that on one hand, it is economically undesirable to abundant the already adopted (keyless) functions in favour of new (keyed) ones, and on the other hand, the process of converting a keyless function to a keyed one is, evidently, non-trivial. A solution to this dilemma is to adopt the "Integratedkey" approach that creates keyed hash functions out of "Unmodified" keyless primitives.

Provided by: University of Bath Topic: Security Date Added: Jan 2012 Format: PDF

Find By Topic