Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle

DOI10.1007/978-3-031-09234-3_4OpenAlexW4285230727MaRDI QIDQ2096604

Tetsu Iwata, Akiko Inoue, Kazuhiko Minematsu

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_4

zbMATH Keywords

provable securityauthenticated encryptionNISTlightweight cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blockcipher-based authenticated encryption: how small can we go?
• Related-Key Forgeries for Prøst-OTR
• KDM-CCA Security from RKA Secure Authenticated Encryption
• Related-Key Chosen IV Attacks on Grain-v1 and Grain-128
• A Provable-Security Treatment of the Key-Wrap Problem
• Blockcipher-Based Authenticated Encryption: How Small Can We Go?
• GIFT: A Small Present
• The PHOTON Family of Lightweight Hash Functions
• A Chosen IV Related Key Attack on Grain-128a
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Fast Software Encryption
• Fast Software Encryption

This page was built for publication: Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle