On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes

DOI10.1007/978-3-662-43933-3_15zbMath1321.94086OpenAlexW1414755073MaRDI QIDQ2946883

Carlos Cid, Gordon Procter

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Tweak-Length Extension for Tweakable Blockciphers ⋮ Partition oracles from weak key forgeries ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Weak-Key and Related-Key Analysis of Hash-Counter-Hash Tweakable Enciphering Schemes ⋮ Weak Keys for AEZ, and the External Key Padding Attack ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptographic hardware and embedded systems - CHES 2012. 14th international workshop, Leuven, Belgium, September 9--12, 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
• Cryptology and network security. 11th international conference, CANS 2012, Darmstadt, Germany, December 12--14, 2012. Proceedings
• Topics in cryptology -- CT-RSA 2010. The cryptographers' track at the RSA conference 2010, San Francisco, CA, USA, March 1--5, 2010. Proceedings
• New stream cipher designs. The eSTREAM finalists
• Post-quantum cryptography. Third international workshop, PQCrypto 2010, Darmstadt, Germany, May 25--28, 2010. Proceedings
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• Universal hashing and authentication codes
• Implementing CFS
• Breaking and Repairing GCM Security Proofs
• MAC Reforgeability
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Information-Set Decoding for Linear Codes over F q
• A Timing Attack against the Secret Permutation in the McEliece PKC
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• Code-based cryptography
• The algebraic decoding of Goppa codes
• Codes Which Detect Deception
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems
• Complexity of Computer Computations
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• Fast Software Encryption
• Factoring Polynomials Over Large Finite Fields
• Progress in Cryptology - INDOCRYPT 2004
• Fast Software Encryption

This page was built for publication: On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes