Optimal forgeries against polynomial-based MACs and GCM

Recommendations

On weak keys and forgery attacks against polynomial-based MAC schemes
On weak keys and forgery attacks against polynomial-based MAC schemes
Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
Twisted Polynomials and Forgery Attacks on GCM
Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries

Cites work

scientific article; zbMATH DE number 4191111 (Why is no real title available?)
scientific article; zbMATH DE number 176541 (Why is no real title available?)
scientific article; zbMATH DE number 1302860 (Why is no real title available?)
scientific article; zbMATH DE number 1024043 (Why is no real title available?)
scientific article; zbMATH DE number 1024067 (Why is no real title available?)
scientific article; zbMATH DE number 1418297 (Why is no real title available?)
scientific article; zbMATH DE number 1418298 (Why is no real title available?)
A Framework for Efficient and Composable Oblivious Transfer
A New Algorithm for Factoring Polynomials Over Finite Fields
A Tight Bound for EMAC
Advances in cryptology - CRYPTO '93. 13th annual international cryptology conference, Santa Barbara, CA, USA, August 22 - 26, 1993. Proceedings
Advances in cryptology - CRYPTO '99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15--19, 1999. Proceedings
Analyzing multi-key security degradation
Authentication key recovery on Galois/counter mode (GCM)
Breaking and repairing GCM security proofs
Codes Which Detect Deception
Computationally secure oblivious transfer
Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
Factoring Polynomials Over Large Finite Fields
Fast Software Encryption
Fast Software Encryption
GCM security bounds reconsidered
How many queries are needed to distinguish a truncated random permutation from a random function?
Improved Security Analyses for CBC MACs
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
MAC Reforgeability
MMH: Software message authentication in the Gbit/second rates
Message Authentication on 64-Bit Architectures
New hash functions and their use in authentication and set equality
On fast and provably secure message authentication based on universal hashing
On the influence of message length in PMAC's security bounds
On the security of iterated message authentication codes
On weak keys and forgery attacks against polynomial-based MAC schemes
On weak keys and forgery attacks against polynomial-based MAC schemes
Perfect zero-knowledge arguments for NP using any one-way permutation
Progress in Cryptology - INDOCRYPT 2004
Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
The Security and Performance of “GCM” when Short Multiplications Are Used Instead
The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
The exact PRF-security of NMAC and HMAC
Twisted Polynomials and Forgery Attacks on GCM
Two halves make a whole: reducing data transfer in garbled circuits using half gates

Cited in

(11)

The summation-truncation hybrid: reusing discarded bits for free
Extending AES improvements: a proposal for alpha-MAC in view of collision resistance
Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
Variants of Wegman-Carter message authentication code supporting variable tag lengths
Twisted Polynomials and Forgery Attacks on GCM
Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries
Single-trace side-channel analysis on polynomial-based MAC schemes
Forgery Attacks on Round-Reduced ICEPOLE-128
Categorization of faulty nonce misuse resistant message authentication
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: Optimal forgeries against polynomial-based MACs and GCM

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