On weak keys and forgery attacks against polynomial-based MAC schemes

DOI10.1007/S00145-014-9178-9zbMATH Open1332.94093OpenAlexW2090529730MaRDI QIDQ901368FDOQ901368

Authors: Gordon Procter, Carlos Cid 

Publication date: 11 January 2016

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-014-9178-9

Recommendations

• On weak keys and forgery attacks against polynomial-based MAC schemes
• Optimal forgeries against polynomial-based MACs and GCM
• scientific article; zbMATH DE number 1759778
• Forgery and Key Recovery Attacks on PMAC and Mitchell’s TMAC Variant
• Almost universal forgery attacks on AES-based MAC's
• Cryptanalyses on a Merkle-Damgård based MAC -- almost universal forgery and distinguishing-\(H\) attacks
• Single-trace side-channel analysis on polynomial-based MAC schemes
• Generic universal forgery attack on iterative hash-based MACs
• Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions

zbMATH Keywords

universal hashingMACweak keyscycling attacksGalois/counter mode

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• MMH: Software message authentication in the Gbit/second rates
• Fast Software Encryption
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• On fast and provably secure message authentication based on universal hashing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes Which Detect Deception
• Title not available (Why is that?)
• Factoring Polynomials Over Large Finite Fields
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2004
• Breaking and repairing GCM security proofs
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Universal hashing and authentication codes
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• MAC Reforgeability
• Title not available (Why is that?)
• Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Title not available (Why is that?)
• Fast Software Encryption

Cited In (12)

• Optimal forgeries against polynomial-based MACs and GCM
• Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries
• Another Look at Security Theorems for 1-Key Nested MACs
• The Missing Difference problem, and its applications to counter mode encryption
• Partition oracles from weak key forgeries
• Forgery Attacks on Round-Reduced ICEPOLE-128
• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
• Almost universal forgery attacks on AES-based MAC's
• Twisted Polynomials and Forgery Attacks on GCM
• Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Single-trace side-channel analysis on polynomial-based MAC schemes

Uses Software

• MMH
• Poly1305-AES

This page was built for publication: On weak keys and forgery attacks against polynomial-based MAC schemes

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