Authenticated encryption for very short inputs

DOI10.1007/978-3-031-30872-7_21MaRDI QIDQ6057194zbMATH OpenOpenAlexFDO

Authors Alexandre Adomnicai, Kazuhiko Minematsu, Junji Shikata

Publication date 4 October 2023

Published in Topics in Cryptology – CT-RSA 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30872-7_21

zbMATH Keywords

authenticated encryptionblock cipherInternet of Thingsshort inputs

Mathematics Subject Classification ID

Internet topics (68M11) Cryptography (94A60)

Review text

The authors study authenticated encryption (AE) modes dedicated to very short messages, which are crucial for Internet-of-Things applications. Because the existing general-purpose AE modes need at least three block cipher calls for non-empty messages, they explore the design space for AE modes that use at most two calls. They propose a family of AE modes, dubbed Manx, that work when the total input length is less than \(2n\) bits, using an \(n\)-bit block cipher. Notably, the second construction of Manx can encrypt almost \(n\)-bit plaintext and saves one or two block cipher calls from the standard modes, such as GCM or OCB, keeping comparable provable security. They also present benchmarks on popular 8/32-bit microprocessors using AES. Their result shows the clear advantage of Manx over the previous modes for such short messages. For the entire collection see [Zbl 1521.94005].

Recommendations

• Forkcipher: a new primitive for authenticated encryption of very short messages
• Authenticated encryption with small stretch (or, how to accelerate AERO)
• CLOC: authenticated encryption for short input
• Blockcipher-based authenticated encryption: how small can we go?
• Parallelizable authenticated encryption with small state size

Cites work

• A Provable-Security Treatment of the Key-Wrap Problem
• Blockcipher-based authenticated encryption: how small can we go?
• CLOC: authenticated encryption for short input
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Forkcipher: a new primitive for authenticated encryption of very short messages
• GIFT: a small present. Towards reaching the limit of lightweight encryption
• scientific article; zbMATH DE number 1583788 (Why is no real title available?)
• scientific article; zbMATH DE number 1583804 (Why is no real title available?)
• scientific article; zbMATH DE number 1942411 (Why is no real title available?)
• scientific article; zbMATH DE number 1759277 (Why is no real title available?)
• Improved Security Analysis of XEX and LRW Modes
• Key wrapping with a fixed permutation
• Nonces are noticed: AEAD revisited
• OMAC: one-key CBC MAC.
• The software performance of authenticated-encryption modes

Cited in

(10)

• The \(\mathsf{mF}\) mode of authenticated encryption with associated data
• Forkcipher: a new primitive for authenticated encryption of very short messages
• Blockcipher-based authenticated encryption: how small can we go?
• Authenticated encryption with small stretch (or, how to accelerate AERO)
• CLOC: authenticated encryption for short input
• scientific article; zbMATH DE number 6985624 (Why is no real title available?)
• The low-call diet: authenticated encryption for call counting HSM users
• Blockcipher-based authenticated encryption: how small can we go?
• Comprehensive robustness analysis of GCM, CCM, and OCB3
• Parallelizable authenticated encryption with small state size

This page was built for publication: Authenticated encryption for very short inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057194)