Efficient multiplications in F₅^5n and F₇^7n
From MaRDI portal
Publication:645700
Recommendations
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Five, six, and seven-term Karatsuba-like formulae
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
Cites work
- scientific article; zbMATH DE number 3688713 (Why is no real title available?)
- A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
- Algebraic function fields and codes
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Five, six, and seven-term Karatsuba-like formulae
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- Multiplication of polynomials modulo \(x^n\)
- On multiplication in finite fields
- On the tensor rank of the multiplication in the finite fields
- The Magma algebra system. I: The user language
Cited in
(5)- Efficient multiplication in finite field extensions of degree 5
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- Five, six, and seven-term Karatsuba-like formulae
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
This page was built for publication: Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645700)
