Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages

Elena Andreeva (1) , Virginie Lallemand (2) , Antoon Purnal (1) , Reza Reyhanitabar (3) , Arnab Roy (4) , Damian Vizár (5)

1 IMEC - IMEC
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
3 TE Connectivity Ltd
4 University of Bristol [Bristol]
5 CSEM - Centre Suisse d'Electronique et de Microtechnique SA [Neuchatel]

Highly efficient encryption and authentication of short messages is an essential requirement for enabling security in constrained scenarios such as the CAN FD in automotive systems (max. message size 64 bytes), massive IoT, critical communication domains of 5G, and Narrowband IoT, to mention a few. In addition, one of the NIST lightweight cryptography project requirements is that AEAD schemes shall be “optimized to be efficient for short messages (e.g., as short as 8 bytes)”. In this work we introduce and formalize a novel primitive in symmetric cryptography called a forkcipher. A forkcipher is a keyed function expanding a fixed-length input to a fixed-length output. We define its security as indistinguishability under chosen ciphertext attack. We give a generic construction validation via the new iterate-fork-iterate design paradigm. We then propose ForkSkinny as a concrete forkcipher instance with a public tweak and based on SKINNY: a tweakable lightweight block cipher constructed using the TWEAKEY framework. We conduct extensive cryptanalysis of ForkSkinny against classical and structure-specific attacks. We demonstrate the applicability of forkciphers by designing three new provably-secure, nonce-based AEAD modes which offer performance and security tradeoffs and are optimized for efficiency of very short messages. Considering a reference block size of 16 bytes, and ignoring possible hardware optimizations, our new AEAD schemes beat the best SKINNY-based AEAD modes. More generally, we show forkciphers are suited for lightweight applications dealing with predominantly short messages, while at the same time allowing handling arbitrary messages sizes. Furthermore, our hardware implementation results show that when we exploit the inherent parallelism of ForkSkinny we achieve the best performance when directly compared with the most efficient mode instantiated with the SKINNY block cipher.

Mots clés: Authenticated encryption; New primitive; Lightweight cryptography; Short messages; ForkSkinny; Forkcipher

Domaines: Cryptographie et sécurité [cs.CR]

Elena Andreeva, Virginie Lallemand, Antoon Purnal, Reza Reyhanitabar, Arnab Roy, et al.. Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages. ASIACRYPT 2019 - 25th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.153-182, ⟨10.1007/978-3-030-34621-8_6⟩. ⟨hal-02388234⟩