On multiplication in finite fields
type: Item
instance of: scholarly article
title: On multiplication in finite fields
zbMATH Open document ID: 1227.65036
author: Murat Cenk
author: Ferruh Özbudak
published in: Journal of Complexity
publication date: 2010-04-21T00:00:00Z
review text: The authors introduce complexity notions and give a brief review of algebraic fields. They propose a method for multiplication in finite fields. The method is shown to be a significant improvement over the best known bilinear complexities for certain finite fields. Upper bounds for a well known bilinear complexity are given and the resulting improvements are pointed out. Some examples of computing multiplicative complexity of finite fields with large number of elements used in cryptography are shown. Finally, the authors describe methods for getting explicit formulae for upper bounds and also give an example.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11T30
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5696555
zbMATH Keywords: finite fields
zbMATH Keywords: algebraic function fields
zbMATH Keywords: bilinear complexity
reviewed by: R. P. Tewarson
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: j.jco.2009.11.002
OpenAlex ID: W2039816130
cites work: Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
cites work: Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
cites work: Multiplication algorithm in a finite field and tensor rank of the multiplication.
cites work: On the bounds of the bilinear complexity of multiplication in some finite fields
cites work: Q3000307
cites work: An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
cites work: On the tensor rank of the multiplication in the finite fields
cites work: Q3545361
cites work: The Magma algebra system. I: The user language
cites work: Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
cites work: Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
cites work: Algebraic complexities and algebraic curves over finite fields
cites work: Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
cites work: Five, six, and seven-term Karatsuba-like formulae
cites work: Rational points on curves over finite fields. Theory and Applications
cites work: Constructions of digital nets using global function fields
cites work: Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
cites work: Q4425740
cites work: Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
cites work: Q4027646
cites work: Algebraic function fields and codes
cites work: A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
cites work: Q3883493
cites work: Low-discrepancy sequences obtained from algebraic function fields over finite fields
cites work: Constructions of algebraic-geometry codes
DOI: 10.1016/J.JCO.2009.11.002
description: scientific article; zbMATH DE number 5696555