Pages that link to "Item:Q765476"
From MaRDI portal
The following pages link to Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476):
Displaying 12 items.
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- Evaluating Bernstein-Rabin-Winograd polynomials (Q1727367) (← links)
- \textsf{FAST}: disk encryption and beyond (Q2070266) (← links)
- Secure GCM implementation on AVR (Q2413216) (← links)
- Efficient public-key operation in multivariate schemes (Q2415397) (← links)
- Implementing GCM on ARMv8 (Q2790037) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- The Software Performance of Authenticated-Encryption Modes (Q3013091) (← links)
- Online Ciphers from Tweakable Blockciphers (Q3073710) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- RIV for Robust Authenticated Encryption (Q4639469) (← links)
- Parallel verification of serial MAC and AE modes (Q6618590) (← links)
