Estimation of Various Scalar Multiplication Algorithms in ECC

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 oth...

Full description

Saved in:
Bibliographic Details
Published in:International journal of innovative technology and exploring engineering 2019-07, Vol.8 (6S4), p.183-186
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2278-3075
2278-3075
DOI:10.35940/ijitee.F1036.0486S419