Efficient Instances of Docked Double Decker with AES, and Application to Authenticated Encryption
Christoph Dobraunig, Krystian Matusiewicz, Bart Mennink, Alexander Tereschenko
Abstract
A tweakable wide blockcipher is a construction which behaves in the same way as a tweakable blockcipher, with the difference that the actual block size is flexible. Due to this feature, a tweakable wide blockcipher can be directly used as a strong encryption scheme that provides full diffusion when encrypting plaintexts to ciphertexts and vice versa. Furthermore, it can be the basis of authenticated encryption schemes fulfilling the strongest security notions. In this paper, we present three instantiations of the docked double decker tweakable wide blockcipher: ddd -AES , ddd -AES + , and bbb-ddd -AES . These instances exclusively use similar building blocks as AES-GCM (AES and finite field multiplication), are designed for maximal parallelism, and hence, can make efficient use of existing hardware accelerators. ddd -AES is a birthday bound secure scheme, and ddd -AES + is an immediate generalization to allow for variable length tweaks. bbb-ddd -AES achieves security beyond the birthday bound provided that the same tweak is not used too often. Moreover, bbb-ddd -AES builds upon a novel conditionally beyond birthday bound secure pseudorandom function, a tweakable variant of the XOR of permutations, facilitating in the need to include a tweak in the AES evaluations without sacrificing flexibility in docked double decker. We furthermore introduce an authenticated encryption mode aaa specifically tailored to be instantiated with ddd -AES and bbb-ddd -AES , where special attention is given to how the nonce and associated data can be processed. We prove that this mode is secure in the nonce-respecting setting, in the nonce-misuse setting, as well as in the setting where random nonces are used. We finally present a comparison with other tweakable wide blockciphers, give a high-level idea of the efficiency potential of our schemes, and provide benchmarks that confirm this idea.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 68daee50-7ccf-437f-a904-c748ec2510c0Builds on2
Related papers
- Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key DerivationShay Gueron, Yehuda LindellCCS 2017 · 38 citations
- TNT: How to Tweak a Block CipherZhenzhen Bao, Chun Guo, Jian Guo, Ling SongEUROCRYPT 2020 · 20 citations
- Generic Attack on Duplex-Based AEAD Modes Using Random Function StatisticsHenri Gilbert, Rachelle Heim Boissier, Louiza Khati, Yann RotellaEUROCRYPT 2023 · 5 citations
- Making GCM Great Again: Toward Full Security and Longer NoncesWoohyuk Chung, Seongha Hwang, Seongkwang Kim, Byeonghak Lee et al.EUROCRYPT 2025 · 2 citations
- Security of Streaming Encryption in Google's Tink LibraryViet Tung Hoang, Yaobin ShenCCS 2020
