On weak keys and forgery attacks against polynomial-based MAC schemes
From MaRDI portal
Publication:901368
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
Cites work
- scientific article; zbMATH DE number 54007 (Why is no real title available?)
- scientific article; zbMATH DE number 1024067 (Why is no real title available?)
- scientific article; zbMATH DE number 1088919 (Why is no real title available?)
- scientific article; zbMATH DE number 1161253 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2124954 (Why is no real title available?)
- scientific article; zbMATH DE number 1406775 (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?)
- Breaking and repairing GCM security proofs
- Codes Which Detect Deception
- Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
- Factoring Polynomials Over Large Finite Fields
- Fast Software Encryption
- Fast Software Encryption
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- MAC Reforgeability
- MMH: Software message authentication in the Gbit/second rates
- New hash functions and their use in authentication and set equality
- On fast and provably secure message authentication based on universal hashing
- 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
- Universal classes of hash functions
- Universal hashing and authentication codes
Cited in
(12)- Another Look at Security Theorems for 1-Key Nested MACs
- Almost universal forgery attacks on AES-based MAC's
- Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
- Optimal forgeries against polynomial-based MACs and GCM
- Twisted Polynomials and Forgery Attacks on GCM
- Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- Single-trace side-channel analysis on polynomial-based MAC schemes
- Forgery Attacks on Round-Reduced ICEPOLE-128
- The Missing Difference problem, and its applications to counter mode encryption
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Partition oracles from weak key forgeries
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)
