Welcome to the resource topic for 2021/737
Title:
GIFT-COFB is Tightly Birthday Secure with Encryption Queries
Authors: Akiko Inoue, 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 n-bit block cipher, we need 2^{n/2} encrypted blocks or 2^{n/2}/n decryption queries to break the scheme. This paper shows that the former condition is indeed tight, by presenting forgery attacks that work with 2^{n/2} encrypted blocks with single decryption query. This fills the missing spot of previous attacks presented by Khairallah, and confirms the tightness of the security bounds with respect to encryption. We remark that our attacks work independent of the underlying block cipher.
ePrint: https://eprint.iacr.org/2021/737
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .