Paper 2017/841 Original: eprint.iacr.org/2017/841 ↗
Efficient Length Doubling From Tweakable Block Ciphers
Abstract
We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n-1]. The LDT mode is simple, uses only two cryptographic primitive calls (while prior work needs at least four), and is a strong length-preserving pseudorandom permutation if the underlying tweakable block ciphers are strong tweakable pseudorandom permutations. We demonstrate that LDT can be used to neatly turn an authenticated encryption scheme for integral data into a mode for arbitrary-length data.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2017-09-06: last updated
- 2017-09-06: published
- Short URL
- https://ia.cr/2017/841
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/841,
author = {Yu Long Chen and Atul Luykx and Bart Mennink and Bart Preneel},
title = {Efficient Length Doubling From Tweakable Block Ciphers},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/841},
year = {2017},
url = {https://eprint.iacr.org/2017/841}
}