Cryptology ePrint Archive: Report 2015/214

GCM Security Bounds Reconsidered

Yuichi Niwa and Keisuke Ohashi and Kazuhiko Minematsu and Tetsu Iwata

Abstract: A constant of $2^{22}$ appears in the security bounds of the Galois/Counter Mode of Operation, GCM. In this paper, we first develop an algorithm to generate nonces that have a high counter-collision probability. We show concrete examples of nonces with the counter-collision probability of about $2^{20.75}/2^{128}$. This shows that the constant in the security bounds, $2^{22}$, cannot be made smaller than $2^{19.74}$ if the proof relies on ``the sum bound.'' We next show that it is possible to avoid using the sum bound, leading to improved security bounds of GCM. One of our improvements shows that the constant of $2^{22}$ can be reduced to 32.

Category / Keywords: secret-key cryptography / GCM, provable security, counter-collision, the sum bound.

Original Publication (with minor differences): IACR-FSE-2015

Date: received 6 Mar 2015

Contact author: iwata at cse nagoya-u ac jp

Available format(s): PDF | BibTeX Citation

Version: 20150308:083612 (All versions of this report)

Short URL: ia.cr/2015/214

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]