Efficient multiplications in F₅^5n and F₇^7n
DOI10.1016/J.CAM.2011.06.016zbMATH Open1247.11150OpenAlexW2747621294WikidataQ114202152 ScholiaQ114202152MaRDI QIDQ645700FDOQ645700
Authors: Murat Cenk, Ferruh Özbudak 
Publication date: 10 November 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.06.016
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}}$
Symbolic computation and algebraic computation (68W30) Finite fields (field-theoretic aspects) (12E20) Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- The Magma algebra system. I: The user language
- Algebraic function fields and codes
- Five, six, and seven-term Karatsuba-like formulae
- Multiplication of polynomials modulo \(x^n\)
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- On the tensor rank of the multiplication in the finite fields
- On multiplication in finite fields
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- Title not available (Why is that?)
- A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
Cited In (5)
- 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}}$
- Efficient multiplication in finite field extensions of degree 5
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
Uses Software
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)
