Pages that link to "Item:Q4974987"
From MaRDI portal
The following pages link to Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem (Q4974987):
Displaying 9 items.
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- Multiplication of polynomials modulo \(x^n\) (Q551166) (← links)
- Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) (Q645700) (← links)
- On multiplication in finite fields (Q964921) (← links)
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\) (Q2431340) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields (Q2788750) (← links)
- Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms (Q2949471) (← links)
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 (Q3506396) (← links)
