On multiplication in finite fields (Q964921)

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.