Twisted Polynomials and Forgery Attacks on GCM

DOI10.1007/978-3-662-46800-5_29MaRDI QIDQ2948354zbMATH OpenOpenAlexFDO

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

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

authenticated encryptionGCMPOETpolynomial hashingtwisted polynomial ring (ore ring)weak keys

Mathematics Subject Classification ID

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

Recommendations

• Optimal forgeries against polynomial-based MACs and GCM
• Universal forgery attack against GCM-RUP
• Forgery Attacks on Round-Reduced ICEPOLE-128
• Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
• On weak keys and forgery attacks against polynomial-based MAC schemes
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Coding and Cryptography
• Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
• Algebraic attacks against several weak variants of GVW'13 ABE

Cited in

(9)

• Optimal forgeries against polynomial-based MACs and GCM
• Partition oracles from weak key forgeries
• Forgery Attacks on Round-Reduced ICEPOLE-128
• Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Comprehensive robustness analysis of GCM, CCM, and OCB3

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948354)