GCM Security Bounds Reconsidered

DOI10.1007/978-3-662-48116-5_19zbMath1382.94148OpenAlexW2227155019MaRDI QIDQ2946953

Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu, Yuichi Niwa

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

zbMATH Keywords

provable securitycounter-collisionGCM security boundsthe sum bound

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Optimal forgeries against polynomial-based MACs and GCM ⋮ XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation ⋮ How fast can SM4 be in software? ⋮ Authenticated Encryption with Small Stretch (or, How to Accelerate AERO) ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3

This page was built for publication: GCM Security Bounds Reconsidered