On the complexity of multiplication in finite fields

Recommendations

On multiplication in finite fields
On the bounds of the bilinear complexity of multiplication in some finite fields
Multiplication algorithm in a finite field and tensor rank of the multiplication.
STACS 2005
scientific article; zbMATH DE number 2231494

Cites work

scientific article; zbMATH DE number 3577144 (Why is no real title available?)
scientific article; zbMATH DE number 3322464 (Why is no real title available?)
A new approach to error-correcting codes
Algebras Having Linear Multiplicative Complexities
On multiplication in algebraic extension fields
On the number of multiplications necessary to compute certain functions
Some bilinear forms whose multiplicative complexity depends on the field of constants

Cited in

(35)

Polynomial multiplication over finite fields: from quadratic to straight-line complexity
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
Algebraic complexities and algebraic curves over finite fields
On fast multiplication of polynomials over arbitrary algebras
Multiplicative complexity of direct sums of quadratic systems
On the hardness of the finite field isomorphism problem
On arithmetical algorithms over finite fields
Trisymmetric multiplication formulae in finite fields
Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields
Faster polynomial multiplication over finite fields
A lower bound for the multiplication of polynomials modulo a polynomial
Curves with many points and multiplication complexity in any extension of $\mathbb{F}_q$
Gaps between prime numbers and tensor rank of multiplication in finite fields
Inversion of two level circulant matrices over $\mathbb{Z}_{p}$
Inversion of circulant matrices over $\mathbf{Z}_m$
Multiplicative complexity of polynomial multiplication over finite fields
The complexity of certain multi-exponentiation techniques in cryptography
On bilinear complexity of multiplying $2 \times 2$-matrix by $2 \times m$-matrix over finite field
On the bounds of the bilinear complexity of multiplication in some finite fields
A survey of some recent bit-parallel $\mathrm{GF}(2^n)$ multipliers
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
Multiplicity one theorems for GSp(k,2n) and O(k,n), where k is a finite field
Complexity of Boolean schemes for arithmetic in some towers of finite fields
scientific article; zbMATH DE number 5244190 (Why is no real title available?)
An improvement of bilinear complexity bounds in some finite fields.
Complexity of multiplication in commutative group algebras over fields of prime characteristic
Multiplicative complexity of vector valued Boolean functions
Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
Multiplication algorithm in a finite field and tensor rank of the multiplication.
scientific article; zbMATH DE number 2231494 (Why is no real title available?)
A lower bound for polynomial multiplication
STACS 2005
On multiplication in finite fields
The equivariant complexity of multiplication in finite field extensions
scientific article; zbMATH DE number 922253 (Why is no real title available?)

This page was built for publication: On the complexity of multiplication in finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171378)