Open AccessEstimation of Various Scalar Multiplication Algorithms in ECC
Author(s) -
Vimal Gaur,
Balwant Singh,
Nimisha Mishra
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.f1036.0486s419
Subject(s) - scalar multiplication , elliptic curve cryptography , elliptic curve digital signature algorithm , public key cryptography , computer science , key size , cryptography , scalar (mathematics) , elliptic curve , cryptosystem , arithmetic , key (lock) , elliptic curve point multiplication , lattice based cryptography , algorithm , curve25519 , mathematics , computer security , encryption , pure mathematics , quantum cryptography , physics , geometry , quantum mechanics , quantum information , quantum
this modern era of security, public key cryptography is quite popular and holds a great significance. Various public key cryptosystems are available in today’s environment such as RSA and ECC. Elliptic Curve cryptography is beneficial in a lot of aspects which includes shorter key as compared to other cryptosystems, high security, fast processing speed, low storage, low bandwidth, small software print, low hardware implementation costs, high performance. The main and the costliest step in ECC is the Scalar Multiplication. In scalar multiplication, integer multiple of an element in additive group of elliptic curves is calculated. In this paper, we compare various available algorithms for the scalar multiplication used in ECC.