Paper 2020/738
GIFT-COFB
Subhadeep Banik, Avik Chakraborti, Akiko Inoue, Tetsu Iwata, Kazuhiko Minematsu, Mridul Nandi, Thomas Peyrin, Yu Sasaki, Siang Meng Sim, and Yosuke Todo
Abstract
In this article, we propose GIFT-COFB, an Authenticated Encryption with Associated Data (AEAD) scheme, based on the GIFT lightweight block cipher and the COFB lightweight AEAD operating mode. We explain how these two primitives can fit together and the various design adjustments possible for performance and security improvements. We show that our design provides excellent performances in all constrained scenarios, hardware or software, while being based on a provably-secure mode and a well analysed block cipher.
Note: We, together with Akiko Inoue, revised the security proof and the bound by incorporating the recent analysis shown by Inoue et al. (ePrint 2022/001). Akiko Inoue joined the co-authors. We also updated third-party analysis sections, including the invalidity of a recent result on the biclique attack against GIFT.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- GIFTCOFBauthenticated encryptionlightweightlower bound
- Contact author(s)
- giftcofb @ googlegroups com
- History
- 2022-05-08: revised
- 2020-06-18: received
- See all versions
- Short URL
- https://ia.cr/2020/738
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/738,
author = {Subhadeep Banik and Avik Chakraborti and Akiko Inoue and Tetsu Iwata and Kazuhiko Minematsu and Mridul Nandi and Thomas Peyrin and Yu Sasaki and Siang Meng Sim and Yosuke Todo},
title = {GIFT-COFB},
howpublished = {Cryptology ePrint Archive, Paper 2020/738},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/738}},
url = {https://eprint.iacr.org/2020/738}
}
