Optimal extension fields for fast arithmetic in public-key algorithms
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].
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- A comparison of different finite fields for elliptic curve cryptosystems
- An alternative class of irreducible polynomials for optimal extension fields
- Fast implementation of elliptic curve arithmetic in GF(p^n)
- scientific article; zbMATH DE number 5636731
- Theoretical and experimental comparison of efficiency of finite field extensions
- Optimal Extension Field Inversion in the Frequency Domain
- scientific article; zbMATH DE number 1951623 (Why is no real title available?)
- scientific article; zbMATH DE number 1878332 (Why is no real title available?)
- scientific article; zbMATH DE number 5066607 (Why is no real title available?)
- An alternative class of irreducible polynomials for optimal extension fields
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- A comparison of different finite fields for elliptic curve cryptosystems
- Efficient software-implementation of finite fields with applications to cryptography
- Efficient hardware implementation of finite fields with applications to cryptography
This page was built for publication: Optimal extension fields for fast arithmetic in public-key algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249352)
