Breaking and Repairing GCM Security Proofs
From MaRDI portal
Publication:2914249
DOI10.1007/978-3-642-32009-5_3zbMath1294.94053OpenAlexW55486550WikidataQ56475238 ScholiaQ56475238MaRDI QIDQ2914249
Kazuhiko Minematsu, Keisuke Ohashi, Tetsu Iwata
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_3
Related Items (17)
On modes of operations of a block cipher for authentication and authenticated encryption ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation ⋮ Another look at XCB ⋮ How fast can SM4 be in software? ⋮ Robust channels: handling unreliable networks in the record layers of QUIC and DTLS 1.3 ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ ON THE SECURITY OF AEAD-CRYPTOSYSTEM OF THE GCM TYPE ⋮ Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications ⋮ Cryptanalysis of OCB2: attacks on authenticity and confidentiality ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ The memory-tightness of authenticated encryption ⋮ The summation-truncation hybrid: reusing discarded bits for free ⋮ Single-trace side-channel analysis on polynomial-based MAC schemes
This page was built for publication: Breaking and Repairing GCM Security Proofs
