Cryptology ePrint Archive: Report 2007/338

VHASH Security

Wei Dai and Ted Krovetz

Abstract: VHASH is an almost-delta-universal hash family, designed for exceptional performance on computers that multiply 64-bit quantities efficiently. Changes to the algorithm detailed in this note improve both security and performance over the original 2006 version. Speed is improved through a newly analyzed hash construction which allows the use of lower-degree polynomials. Claimed security is higher due primarily to improved analysis and a change in prime modulus. The result is a hash family capable of hashing cache-resident one kilobyte messages on the Intel Core 2 architecture at a rate of about one-half processor cycle per byte of message with a collision probability of less than $1/2^{61}$.

Category / Keywords: secret-key cryptography / Universal hashing, message authentication, Wegman-Carter, VHASH, VMAC.

Date: received 28 Aug 2007

Contact author: tdk at acm org

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20070829:054613 (All versions of this report)

Short URL: ia.cr/2007/338

Discussion forum: Show discussion | Start new discussion