Optimal extension fields for fast arithmetic in public-key algorithms (Q4249352)

This paper gives a very efficient way of computing in certain finite fields of the form \(GF(p^n)\) where \(p\) is chosen close to the word size of the underlying architecture and \(n\) is chosen so that \(x^n - \omega\) is irreducible, for some \(\omega \in GF(p)\). Greater efficiencies are achieved when \(\omega\) is chosen to be equal to two. Such fields are called Optimal Extension Fields (OEFs) by the authors. These increases in efficiency are obtained by having an improved multiplication routine compared to other types of finite fields, and a much faster inversion routine. The authors claim that such fields would be suitable for elliptic curve cryptography, however such an application is unlikely to be commercially successful since current elliptic curve standards only recommend using curves defined over large prime finite fields, \(GF(p)\), or fields of characteristic two, \(GF(2^p)\), with prime degree, \(p\), over \(GF(2)\). For the entire collection see [Zbl 0895.00067].