Efficient Length Doubling From Tweakable Block Ciphers

  • Chen Y
  • Luykx A
  • Mennink B
  • et al.
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Chen, Y. L., Luykx, A., Mennink, B., & Preneel, B. (2017). Efficient Length Doubling From Tweakable Block Ciphers. IACR Transactions on Symmetric Cryptology, 253–270. https://doi.org/10.46586/tosc.v2017.i3.253-270

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free