UniversalHash Algorithms

Links

Design and Analysis

Description

UniversalHash algorithms are keyed hash functions with specific provable security properties. Although they have an interface similar to a MAC, it is not secure to use a UniversalHash directly as a MAC. [[Explain what should be done instead.]]

In some cases, a MAC algorithm based on a particular UniversalHash may be defined (e.g. UMAC32 is based on UHASH32). Alteratively, a DEM or MAC construction can be defined generically in terms of any UniversalHash. (UST may be an example of this.)

× UHASH16[(signedFlag,
preferredEndian,l1KeyLen,outputLen)] 		UniversalHash Construction
Designers:
Theodore Krovetz, John Black, Shai Halevi, A. Hevia, Hugo Krawczyk, Phillip Rogaway
Published:
November 2000
Description:
This is UHASH from the version of UMAC submitted to the NESSIE project (UMAC 2000), with the 16-bit parameter set. The default parameters are signedFlag = S, preferredEndian = LE, l1KeyLen = 1024, outputLen = 8.

Note that the signed default is different from UHASH32.

References:
Key length:
As block cipher.
Output length:
As given by outputLen parameter.
Parameters:

× UHASH32[(signedFlag,
preferredEndian,l1KeyLen,outputLen,cipher)] 		UniversalHash Construction
Designers:
Theodore Krovetz, John Black, Shai Halevi, A. Hevia, Hugo Krawczyk, Phillip Rogaway
Published:
November 2000
Description:
This is UHASH from the version of UMAC submitted to the NESSIE project (UMAC 2000), with the 32-bit parameter set. The default parameters are signedFlag = U, preferredEndian = LE, l1KeyLen = 1024, outputLen = 8.

Note that the unsigned default is different from UMAC16.

References:
Key length:
As block cipher.
Output length:
As given by outputLen parameter.
Parameters:

Alleged UniversalHashes

Valid HTML 4.0 Valid CSS Copyright and trademarks