Paper 2007/338 Original: eprint.iacr.org/2007/338 ↗
VHASH Security
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}$.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2007-08-29: last updated
- 2007-08-29: published
- Short URL
- https://ia.cr/2007/338
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/338,
author = {Wei Dai and Ted Krovetz},
title = {VHASH Security},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/338},
year = {2007},
url = {https://eprint.iacr.org/2007/338}
}