Twisted Polynomials and Forgery Attacks on GCM

DOI10.1007/978-3-662-46800-5_29zbMath1370.94475OpenAlexW588424841MaRDI QIDQ2948354

Elmar Tischhauser, Beelen, Peter, Andrey Bogdanov, Mohamed Ahmed Abdelraheem

Publication date: 30 September 2015

Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)

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

zbMATH Keywords

POETauthenticated encryptionGCMweak keyspolynomial hashingtwisted polynomial ring (ore ring)

Mathematics Subject Classification ID

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

Related Items (4)

Partition oracles from weak key forgeries ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC

This page was built for publication: Twisted Polynomials and Forgery Attacks on GCM