Almost universal forgery attacks on AES-based MAC's

DOI10.1007/S10623-014-9969-XzbMath1359.94589OpenAlexW2017270479MaRDI QIDQ494579

Orr Dunkelman, Nathan Keller, Adi Shamir

Publication date: 1 September 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-014-9969-x

zbMATH Keywords

message authentication codesalmost universal forgeryalredpelican

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

On the resilience of Even-Mansour to invariant permutations ⋮ Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of a cipher from a single pseudorandom permutation.
• Cryptanalyses on a Merkle-Damgård Based MAC — Almost Universal Forgery and Distinguishing-H Attacks
• Tweakable Blockciphers with Beyond Birthday-Bound Security
• ALE: AES-Based Lightweight Authenticated Encryption
• Domain Extension for MACs Beyond the Birthday Barrier
• Improved Impossible Differential Cryptanalysis of 7-Round AES-128
• New Birthday Attacks on Some MACs Based on Block Ciphers
• Another Look at Complementation Properties
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• Practical Collisions for SHAMATA-256
• Practical Pseudo-collisions for Hash Functions ARIRANG-224/384
• Limitations of the Even-Mansour construction
• 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
• Generic Related-Key Attacks for HMAC
• Automatic Search of Attacks on Round-Reduced AES and Applications
• A New Variant of PMAC: Beyond the Birthday Bound
• Advanced Encryption Standard – AES
• Fast Software Encryption
• New Impossible Differential Attacks on AES

This page was built for publication: Almost universal forgery attacks on AES-based MAC's