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

DOI10.1007/978-3-662-43933-3_15zbMATH Open1321.94086OpenAlexW1414755073MaRDI QIDQ2946883FDOQ2946883

Authors: Gordon Procter, Carlos Cid 

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_15

Recommendations

• 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
• Optimal forgeries against polynomial-based MACs and GCM
• Almost universal forgery attacks on AES-based MAC's

zbMATH Keywords

universal hashingweak keyscycling attacksGalois/counter modeMessage Authentication Codes (MACs)

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• 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
• Information-set decoding for linear codes over \(\mathbb F_q\)
• The algebraic decoding of Goppa codes
• Title not available (Why is that?)
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?)
• Universal hashing and authentication codes
• New stream cipher designs. The eSTREAM finalists
• Cryptographic hardware and embedded systems - CHES 2012. 14th international workshop, Leuven, Belgium, September 9--12, 2012. Proceedings
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• Cryptology and network security. 11th international conference, CANS 2012, Darmstadt, Germany, December 12--14, 2012. Proceedings
• Post-quantum cryptography. 4th international workshop, PQCrypto 2011, Taipei, Taiwan, November 29--December 2, 2011. Proceedings
• Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings
• Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings
• Code-based cryptography
• Topics in cryptology -- CT-RSA 2010. The cryptographers' track at the RSA conference 2010, San Francisco, CA, USA, March 1--5, 2010. Proceedings
• 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
• Fast Software Encryption
• Post-quantum cryptography. Third international workshop, PQCrypto 2010, Darmstadt, Germany, May 25--28, 2010. Proceedings
• A timing attack against the secret permutation in the McEliece PKC
• Timing attacks against the syndrome inversion in code-based cryptosystems
• Implementing CFS
• Complexity of computer computations. Proceedings of a symposium on the complexity of computer computations, held March 20--22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, mathematics program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department

Cited In (15)

• Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
• Tweak-length extension for tweakable blockciphers
• Optimal forgeries against polynomial-based MACs and GCM
• Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries
• Weak keys for AEZ, and the external key padding attack
• Another Look at Security Theorems for 1-Key Nested MACs
• Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
• Partition oracles from weak key forgeries
• Forgery Attacks on Round-Reduced ICEPOLE-128
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• 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

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 Q2946883)