Paper 2017/1075

XHX - A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing

Ashwin Jha, Eik List, Kazuhiko Minematsu, Sweta Mishra, and Mridul Nandi


Tweakable block ciphers are important primitives for designing cryptographic schemes with high security. In the absence of a standardized tweakable block cipher, constructions built from classical block ciphers remain an interesting research topic in both theory and practice. Motivated by Mennink's F[2] publication from 2015, Wang et al. proposed 32 optimally secure constructions at ASIACRYPT'16, all of which employ two calls to a classical block cipher each. Yet, those constructions were still limited to n-bit keys and n-bit tweaks. Thus, applications with more general key or tweak lengths still lack support. This work proposes the XHX family of tweakable block ciphers from a classical block cipher and a family of universal hash functions, which generalizes the constructions by Wang et al. First, we detail the generic XHX construction with three independently keyed calls to the hash function. Second, we show that we can derive the hash keys in efficient manner from the block cipher, where we generalize the constructions by Wang et al.; finally, we propose efficient instantiations for the used hash functions.

Note: This version corrects a subtle error in our formulation of Fact 1 that has been corrected in this version. In our analysis, we implicitly already used a special case where it held.

Available format(s)
Secret-key cryptography
Publication info
Published elsewhere. Minor revision. To appear in proceedings of Latincrypt 2017
Provable securityideal-cipher modeltweakable block cipher
Contact author(s)
eik list @ uni-weimar de
2021-03-08: revised
2017-11-10: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ashwin Jha and Eik List and Kazuhiko Minematsu and Sweta Mishra and Mridul Nandi},
      title = {XHX - A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing},
      howpublished = {Cryptology ePrint Archive, Paper 2017/1075},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.