The Security and Performance of “GCM” when Short Multiplications Are Used Instead

DOI10.1007/978-3-642-38519-3_15zbMath1311.94067OpenAlexW2229133197MaRDI QIDQ4922047

Kazumaro Aoki, Kan Yasuda

Publication date: 28 May 2013

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38519-3_15

zbMATH Keywords

authenticated encryptionGCMnoncepolynomial hash

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Tweak-Length Extension for Tweakable Blockciphers ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes

This page was built for publication: The Security and Performance of “GCM” when Short Multiplications Are Used Instead