The following pages link to (Q2707607):
Displaying 11 items.
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- Polynomial basis multiplication over \(\text{GF}(2^m)\) (Q850783) (← links)
- Fast multiplication of polynomials over fields of characteristic 2 (Q1240012) (← links)
- Montgomery multiplication in \(\text{GF}(2^ k)\) (Q1379662) (← links)
- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates (Q2291393) (← links)
- Secure GCM implementation on AVR (Q2413216) (← links)
- A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
- On efficient normal basis multiplication (Q2707608) (← links)
- Implementing GCM on ARMv8 (Q2790037) (← links)
