Paper 2021/737
GIFT-COFB is Tightly Birthday Secure with Encryption Queries
Akiko Inoue and Kazuhiko Minematsu
Abstract
GIFT-COFB is a finalist of NIST Lightweight cryptography project that aims at standardizing authenticated encryption schemes for constrained devices. It is a block cipher-based scheme and comes with a provable security result. This paper studies the tightness of the provable security bounds of GIFT-COFB, which roughly tells that, if instantiated by a secure
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Authenticated encryptionmode of operationGIFT-COFBbirthday bound
- Contact author(s)
-
a_inoue @ nec com
k-minematsu @ nec com - History
- 2021-06-03: received
- Short URL
- https://ia.cr/2021/737
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/737, author = {Akiko Inoue and Kazuhiko Minematsu}, title = {{GIFT}-{COFB} is Tightly Birthday Secure with Encryption Queries}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/737}, year = {2021}, url = {https://eprint.iacr.org/2021/737} }