Improved Algorithm on Elliptic Curves over Finite Fields of Character Three
Meng Zhou · Microcomputer Information · 2011
As we know, reducing the operation of inverse is an important method in elliptic curve cryptography fast calculation. It requires k times inversions on elliptic curves over finite fields of character three to compute scalar multiplication 2kP by individual computation. This paper deduces a formula of calculating 2kP directly based upon the idea of recursive induction and trading inversions for multiplications, which reduces the inversion to once. According to the compare, the new algorithm decrease computational capacity by 1% comparing to individual computation. The more k is increasing ,the more reduce we get, and it can reduce computational capacity by 26% at most.