Research on Fast Algorithms of Elliptic Curve over 3 n GF
Jingjing Liu, Meng Zhou · 2012
n GF , as a more special type field of n GF p , the elliptic curve cryptosystem based on which has their own advantages. As we know, reducing the operation of inverse is an important method in elliptic curve cryptography fast calculation. It requires 2k times inversions on elliptic curves over 3 n GF 3 k P to compute scalar multiplication by individual computation. This paper deduces a formula of calculating directly based upon the idea of recursive induction a nd trading inversions for multiplication, which reduces the inversion to once. The proposed algorithm is prior to multiple tripling point algorithms when the speed ratio of field inversion to field multiplication is high. And the bigger the ratio is, the more the efficiency improves. 3 k P