On weak keys and forgery attacks against polynomial-based MAC schemes
From MaRDI portal
Publication:2946883
Recommendations
Cites work
- scientific article; zbMATH DE number 1618037 (Why is no real title available?)
- scientific article; zbMATH DE number 3121508 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- 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 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (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?)
- A timing attack against the secret permutation in the McEliece PKC
- Breaking and repairing GCM security proofs
- Code-based cryptography
- Codes Which Detect Deception
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- 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, ma
- Cryptographic hardware and embedded systems - CHES 2012. 14th international workshop, Leuven, Belgium, September 9--12, 2012. 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
- Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
- Factoring Polynomials Over Large Finite Fields
- Fast Software Encryption
- Fast Software Encryption
- Implementing CFS
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- MAC Reforgeability
- New hash functions and their use in authentication and set equality
- New stream cipher designs. The eSTREAM finalists
- On fast and provably secure message authentication based on universal hashing
- Post-quantum cryptography. 4th international workshop, PQCrypto 2011, Taipei, Taiwan, November 29--December 2, 2011. Proceedings
- Post-quantum cryptography. Third international workshop, PQCrypto 2010, Darmstadt, Germany, May 25--28, 2010. Proceedings
- 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
- The algebraic decoding of Goppa codes
- Timing attacks against the syndrome inversion in code-based cryptosystems
- Topics in cryptology -- CT-RSA 2010. The cryptographers' track at the RSA conference 2010, San Francisco, CA, USA, March 1--5, 2010. Proceedings
- Universal classes of hash functions
- Universal hashing and authentication codes
Cited in
(15)- Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
- Optimal forgeries against polynomial-based MACs and GCM
- Tweak-length extension for tweakable blockciphers
- 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)
