Abstract:
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 ...Show MoreMetadata
Abstract:
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 = p6 and p is a large prime.
Date of Conference: 27-29 May 2016
Date Added to IEEE Xplore: 28 July 2016
ISBN Information: