Searching for "On the Complexity of Multiplication in Finite Fields." – sorted by Relevance.
-
Descent of the Definition Field of a Tower of Function Fields and Applications
- of the bilinear complexity of the multiplication in finite fields, for fields of characteristic 2. A key point
- Add To MetaCart
-
Descent of the Definition Field of a Tower of Function Fields and Applications
- asymptotic bounds of the bilinear complexity of the multiplication in finite fields. 2000 Mathematics Subject
- Add To MetaCart
-
A Generalization of D.V. and G.V. Chudnovski Multiplication Algorithm
- complexity of multiplication Let Fq be a finite field with q elements where q is a prime power and let Fqn
- Add To MetaCart

