An improvement of scalar multiplication on elliptic curve defined over extension field Fq2
Md. Al-Amin Khandaker, Yasuyuki Nogami · 2016
In elliptic curve cryptography (ECC), a scalar multiplication for rational point is the most time consuming operation. This paper proposes an efficient calculation for a scalar multiplication by applying Frobenious Mapping. Particularly, this paper deals with Barreto-Naehrig curve defined over extension field Fq2, where q = p6and p is a large prime.