International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: VHASH Security

Authors:
Wei Dai
Ted Krovetz
Download:
URL: http://eprint.iacr.org/2007/338
Search ePrint
Search Google
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}$.
BibTeX
@misc{eprint-2007-13618,
  title={VHASH Security},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / Universal hashing, message authentication, Wegman-Carter, VHASH, VMAC.},
  url={http://eprint.iacr.org/2007/338},
  note={ tdk@acm.org 13753 received 28 Aug 2007},
  author={Wei Dai and Ted Krovetz},
  year=2007
}