Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIwata, Tetsuen_US
dc.contributor.authorKhairallah, Mustafaen_US
dc.contributor.authorMinematsu, Kazuhikoen_US
dc.contributor.authorPeyrin, Thomasen_US
dc.identifier.citationIwata, T., Khairallah, M., Minematsu, K., & Peyrin, T. (2020). Duel of the titans : the Romulus and Remus families of lightweight AEAD algorithms. IACR Transactions on Symmetric Cryptology, 2020(1), 43-120. doi:10.13154/tosc.v2020.i1.43-120en_US
dc.description.abstractIn this article, we propose two new families of very lightweight and efficient authenticated encryption with associated data (AEAD) modes, Romulus and Remus, that provide security beyond the birthday bound with respect to the block-length n. The former uses a tweakable block cipher (TBC) as internal primitive and can be proven secure in the standard model. The later uses a block cipher (BC) as internal primitive and can be proven secure in the ideal cipher model. Both our modes allow to switch very easily from the nonce-respecting to the nonce-misuse scenario. Previous constructions, such as ΘCB3, are quite computationally efficient, yet needing a large memory for implementation, which makes them unsuitable for platforms where lightweight cryptography should play a key role. Romulus and Remus break this barrier by introducing a new architecture evolved from a BC mode COFB. They achieve the best of what can be possible with TBC – the optimal computational efficiency (rate-1 operation) and the minimum state size of a TBC mode (i.e., (n + t)-bit for n-bit block, t-bit tweak TBC), with almost equivalent provable security as ΘCB3. Actually, our comparisons show that both our designs present superior performances when compared to all other recent lightweight AEAD modes, being BC-based, TBC-based or sponge-based, in the nonce-respecting or nonce-misuse scenario. We eventually describe how to instantiate Romulus and Remus modes using the Skinny lightweight tweakable block cipher proposed at CRYPTO 2016, including the hardware implementation results.en_US
dc.description.sponsorshipNanyang Technological Universityen_US
dc.relation.ispartofIACR Transactions on Symmetric Cryptologyen_US
dc.rights© 2020 Tetsu Iwata, Mustafa Khairallah, Kazuhiko Minematsu, Thomas Peyrin. This work is licensed under a Creative Commons Attribution 4.0 International License.en_US
dc.titleDuel of the titans : the Romulus and Remus families of lightweight AEAD algorithmsen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.contributor.researchTemasek Laboratories @ NTUen_US
dc.description.versionPublished versionen_US
dc.subject.keywordsRomulus and Remusen_US
dc.subject.keywordsAuthenticated Encryptionen_US
dc.description.acknowledgementThe second and fourth authors are supported by Temasek Laboratories, Singapore.en_US
item.fulltextWith Fulltext-
Appears in Collections:SPMS Journal Articles
Files in This Item:
File Description SizeFormat 
8560-Article Text-5102-1-10-20200507.pdf1.48 MBAdobe PDFThumbnail

Citations 10

Updated on Jul 10, 2024

Web of ScienceTM
Citations 20

Updated on Oct 31, 2023

Page view(s)

Updated on Jul 16, 2024

Download(s) 50

Updated on Jul 16, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.