### Efficient Tweakable Enciphering Schemes from (Block-Wise) Universal Hash Functions

Palash Sarkar

##### Abstract

This paper describes several constructions of tweakable strong pseudorandom permutations (SPRPs) built from different modes of operations of a block cipher and suitable universal hash functions. For the electronic codebook (ECB) based construction, an invertible blockwise universal hash function is required. We simplify an earlier construction of such a function described by Naor and Reingold. The other modes of operations considered are the counter mode and the output feedback (OFB) mode. All the constructions make the same number of block cipher calls and the same number of multiplications. Combined with a class of polynomials defined by Bernstein, the new constructions provide the currently best known algorithms for the important practical problem of disk encryption.

Note: This is a substantially revised version. The length has been considerably reduced while retaining the essential parts of the paper.

##### Metadata
Available format(s)
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
modes of operationstweakable encryptionstrong pseudo-random permutationdisk encryption
Contact author(s)
palash @ isical ac in
History
2008-07-08: revised
2008-01-03: received
See all versions
Short URL
https://ia.cr/2008/004
License

CC BY

BibTeX

@misc{cryptoeprint:2008/004,
author = {Palash Sarkar},
title = {Efficient Tweakable Enciphering Schemes from (Block-Wise) Universal Hash Functions},
howpublished = {Cryptology ePrint Archive, Paper 2008/004},
year = {2008},
note = {\url{https://eprint.iacr.org/2008/004}},
url = {https://eprint.iacr.org/2008/004}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.