Optimal forgeries against polynomial-based MACs and GCM

DOI10.1007/978-3-319-78381-9_17zbMath1423.94086OpenAlexW2794621867MaRDI QIDQ1648808

Atul Luykx, Bart Preneel

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_17

zbMATH Keywords

polynomialMACforgeryWegman-CarterauthenticatorGalois Counter Mode (GCM)universal hash

Mathematics Subject Classification ID

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

Related Items

Extending AES improvements: A proposal for Alpha-MAC in view of collision resistance ⋮ Variants of Wegman-Carter message authentication code supporting variable tag lengths ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ The summation-truncation hybrid: reusing discarded bits for free

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Perfect zero-knowledge arguments for NP using any one-way permutation
• New hash functions and their use in authentication and set equality
• Advances in cryptology - CRYPTO '99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15--19, 1999. Proceedings
• Advances in cryptology - CRYPTO '93. 13th annual international cryptology conference, Santa Barbara, CA, USA, August 22 - 26, 1993. Proceedings
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Analyzing multi-key security degradation
• How many queries are needed to distinguish a truncated random permutation from a random function?
• Computationally secure oblivious transfer
• Authentication Key Recovery on Galois/Counter Mode (GCM)
• On the Influence of Message Length in PMAC’s Security Bounds
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• The Exact PRF-Security of NMAC and HMAC
• Breaking and Repairing GCM Security Proofs
• On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes
• GCM Security Bounds Reconsidered
• Twisted Polynomials and Forgery Attacks on GCM
• Two Halves Make a Whole
• MAC Reforgeability
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
• A Tight Bound for EMAC
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• A Framework for Efficient and Composable Oblivious Transfer
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Codes Which Detect Deception
• MMH: Software message authentication in the Gbit/second rates
• On the security of iterated message authentication codes
• Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• Message Authentication on 64-Bit Architectures
• Improved Security Analyses for CBC MACs
• Fast Software Encryption
• Factoring Polynomials Over Large Finite Fields
• Progress in Cryptology - INDOCRYPT 2004
• Fast Software Encryption