Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
From MaRDI portal
Publication:2096604
Recommendations
- Revisiting the security of \textsf{COMET} authenticated encryption scheme
- The Oribatida v1.3 family of lightweight authenticated encryption schemes
- A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis
- Breaking and repairing GCM security proofs
- Improved (related-key) differential cryptanalysis on GIFT
Cites work
- A chosen IV related key attack on Grain-128a
- A Provable-Security Treatment of the Key-Wrap Problem
- Blockcipher-based authenticated encryption: how small can we go?
- Blockcipher-based authenticated encryption: how small can we go?
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Fast Software Encryption
- Fast Software Encryption
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1394311 (Why is no real title available?)
- KDM-CCA Security from RKA Secure Authenticated Encryption
- Related-Key Chosen IV Attacks on Grain-v1 and Grain-128
- Related-Key Forgeries for Prøst-OTR
- The PHOTON family of lightweight hash functions
This page was built for publication: Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096604)