Refining Galois/Counter Mode for 256-Bit Blocks: Multilinear Authentication and Security Proofs

Authors

  • Nguyen Tuan Anh
  • Nguyen Bui Cuong
  • Kieu Viet Dich

DOI:

https://doi.org/10.54654/isj.v1i27.6406

Keywords:

GCM, GHASH, authenticated encryption, provable security

Tóm tắt

This paper investigates the feasibility of extending the authenticated encryption mode GCM to a 256-bit block size to increase the amount of authenticated data and enhance security in large-scale information processing systems. Based on an analysis of the limitations of the standard GCM construction, particularly the restriction on the amount of data processed per invocation and the weaknesses arising from the linearity of the GHASH function, we propose a GCM-256 variant employing a 256-bit block cipher together with a multilinear authentication mechanism, replacing the conventional linear GHASH function.

Downloads

Download data is not yet available.

References

. NIST Special Publication 800-38D, “Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC”, National Institute of Standards and Technology, 2007.

. ISO/IEC. Iso/iec 19772:2020 information security — authenticated encryption. 2020.

. McGrew, D.A. and J. Viega. “The security and performance of the Galois/Counter Mode (GCM) of operation” in International Conference on Cryptology in India, 2004.

. Iwata, T., K. Ohashi, and K. Minematsu. “Breaking and repairing GCM security proofs” in Annual Cryptology Conference. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 31-49, 2012.

. Niwa, Yuichi, et al. “GCM security bounds reconsidered” in International Workshop on Fast Software Encryption. Berlin, pp 285-497, 2015.

. Ferguson, N., “Authentication weaknesses in GCM”, May 2005.

. Joux, A., “Authentication failures in NIST version of GCM”, NIST Comment, 2006.

. Saarinen, Markku-Juhani Olavi. “Cycling attacks on GCM, GHASH and other polynomial MACs and hashes” in International Workshop on Fast Software Encryption. Berlin, Heidelberg: Springer Berlin Heidelberg, pp 216-225, 2012.

. RFC, RFC 8452: AES-GCM-SIV: Nonce misuse-resistant authenticated encryption, 2019.

. Akhmetzyanova, Liliya, et al., “Security of multilinear galois mode (MGM)” in Cryptology ePrint Archive, 2019.

. RFC, RFC 8645: Re-keying Mechanisms for Symmetric Keys, 2019.

. Bellare, M. and P. Rogaway. “The security of triple encryption and a framework for code-based game-playing proofs” in Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin, Heidelberg: Springer Berlin Heidelberg, pp 409-426, 2005.

. Long, N. V., Linh, H. D., & Dat, L. Q., “The quantum circuit construction for S-boxes without ancilla qubits: A more detail analysis”, Journal of Science and Technology on Information Security, vol. 1, no. 21, pp. 75-88, 2024. DOI: 10.54654/isj.v1i21.1031.

. Anh, N. T., & Phong, T. Q., “On the security of AEAD scheme is recommended for use in Signal protocol”, Journal of Science and Technology on Information Security, vol. 1, no. 21, pp. 67-74, 2024. DOI: 10.54654/isj.v1i21.1028.

Downloads

Abstract views: 9 / PDF downloads: 2

Published

2026-06-24

How to Cite

Anh, N. T., Cuong, N. B., & Dich, K. V. (2026). Refining Galois/Counter Mode for 256-Bit Blocks: Multilinear Authentication and Security Proofs. Journal of Science and Technology on Information Security, 1(27), 99-108. https://doi.org/10.54654/isj.v1i27.6406

Issue

No 1. CS (27) 2026

Section

Papers

License

Open Access Policy

The Journal of Science and Technology on Information Security provides open access to its published articles to broaden opportunities for high-quality research findings to be available and widely disseminated free of charge, contributing to the greater exchange of knowledge.

Open access statement: CTUJoS permits everyone to read, download, copy, distribute, print, search, or link to the full texts of the published articles without registration, price barriers, or asking for permission from the Journal or the author.

Proposed Policy for Journals That Offer Delayed Open Access

Authors who publish with this journal agree to the following terms:

1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).