Skip to main content

A comparison of different finite fields for use in Elliptic Curve Cryptosystems

N. P. Smart, A comparison of different finite fields for use in Elliptic Curve Cryptosystems. Computers and Mathematics with Applications, 42 (?). ISSN ?, pp. 91–100. October 2001. No electronic version available.

Abstract

We examine the relative efficiency of four methods for finite field representation in the context of elliptic curve cryptography (ECC). We conclude that a set of fields called the Optimized Extension Fields (OEFs) give greater performance, even when used with affine coordinates, when compared against the type of fields recommended in the emerging ECC standards. Although this performance advantage is only marginal and hence there is probably no need to change the current standards to allow OEF fields in standards compliant implementations.

Bibtex entry.

Contact details

Publication Admin