Paper 2007/014 Original: eprint.iacr.org/2007/014 ↗
Invertible Universal Hashing and the TET Encryption Mode
Abstract
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2^n and associated data of arbitrary length. The mode TET is a concrete instantiation of the generic mode of operation that was proposed by Naor and Reingold, extended to handle tweaks and inputs of arbitrary bit length. The main technical tool is a construction of invertible ``universal hashing'' on wide blocks, which is as efficient to compute and invert as polynomial-evaluation hash.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2007-05-24: last updated
- 2007-01-19: published
- Short URL
- https://ia.cr/2007/014
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/014,
author = {Shai Halevi},
title = {Invertible Universal Hashing and the TET Encryption Mode},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/014},
year = {2007},
url = {https://eprint.iacr.org/2007/014}
}