Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes

DOI10.1007/978-3-642-34047-5_13zbMath1282.94064OpenAlexW124625691MaRDI QIDQ4899706

Markku-Juhani O. Saarinen

Publication date: 8 January 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-34047-5_13

zbMATH Keywords

cryptanalysisweak keysAES-GCMcycling attacksGalois/Counter Mode

Mathematics Subject Classification ID

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

Related Items (10)

Partition oracles from weak key forgeries ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ The Missing Difference problem, and its applications to counter mode encryption ⋮ Weak-Key and Related-Key Analysis of Hash-Counter-Hash Tweakable Enciphering Schemes ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ Weak Keys for AEZ, and the External Key Padding Attack ⋮ Новый режим аутентифицированного шифрования для произвольного блочного шифра на основе универсальной функции хэширования ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ Криптосистема блочного гаммирования с аутентификацией

This page was built for publication: Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes