GCM security bounds reconsidered

DOI10.1007/978-3-662-48116-5_19zbMATH Open1382.94148OpenAlexW2227155019MaRDI QIDQ2946953FDOQ2946953

Authors: Yuichi Niwa, Keisuke Ohashi, Kazuhiko Minematsu, Tetsu Iwata 

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48116-5_19

Recommendations

• Breaking and repairing GCM security proofs
• Progress in Cryptology - INDOCRYPT 2004
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Authentication key recovery on Galois/counter mode (GCM)
• Cycling attacks on GCM, GHASH and other polynomial MACs and hashes

zbMATH Keywords

provable securitycounter-collisionGCM security boundsthe sum bound

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• Optimal forgeries against polynomial-based MACs and GCM
• Authenticated encryption with small stretch (or, how to accelerate AERO)
• XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation
• Authentication key recovery on Galois/counter mode (GCM)
• The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
• Breaking and repairing GCM security proofs
• How fast can SM4 be in software?

This page was built for publication: GCM security bounds reconsidered

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946953)