Efficient Algorithms for Elliptic Curve Cryptosystems Public
Downloadable Contentopen in viewer
Elliptic curves are the basis for a relative new class of public-key schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems. This thesis deals with such algorithms. Efficient algorithms for elliptic curves can be classified into low-level algorithms, which deal with arithmetic in the underlying finite field and high-level algorithms, which operate with the group operation. This thesis describes three new algorithms for efficient implementations of elliptic curve cryptosystems. The first algorithm describes the application of the Karatsuba-Ofman Algorithm to multiplication in composite fields <NOBR><I>GF</I>((2<SUP><I>n</I></SUP>)<SUP><I>m</I></SUP>).</NOBR> The second algorithm deals with efficient inversion in composite Galois fields of the form <NOBR><I>GF</I>((2<SUP><I>n</I></SUP>)<SUP><I>m</I></SUP>).</NOBR> The third algorithm is an entirely new approach which accelerates the multiplication of points which is the core operation in elliptic curve public-key systems. The algorithm explores computational advantages by computing repeated point doublings directly through closed formulae rather than from individual point doublings. Finally we apply all three algorithms to an implementation of an elliptic curve system over <NOBR><I>GF</I>((2<SUP>16</SUP>)<SUP>11</SUP>).</NOBR> We provide ablolute performance measures for the field operations and for an entire point multiplication. We also show the improvements gained by the new point multiplication algorithm in conjunction with the <I>k-ary</I> and improved <I>k-ary</I> methods for exponentiation.
- Defense date
- Date created
- Resource type
- Rights statement
Permanent link to this page: https://digital.wpi.edu/show/gt54kn06q