Pages that link to "Item:Q4922047"
From MaRDI portal
The following pages link to The Security and Performance of “GCM” when Short Multiplications Are Used Instead (Q4922047):
Displaying 7 items.
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- Secure GCM implementation on AVR (Q2413216) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Tweak-Length Extension for Tweakable Blockciphers (Q3460099) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712200) (← links)