Survey of Elliptic Curve Scalar Multiplication Algorithms
Journal: International Journal of Advanced Networking and Applications (Vol.4, No. 02)Publication Date: 2012-09-03
Authors : E.Karthikeyan;
Page : 1581-1590
Keywords : Elliptic curve cryptography; binary method; non-adjacent form; scalar multiplication;
Abstract
The standard bodies accepted elliptic curve cryptography as an efficient and alternative public key cryptosystem for the next generation cryptographic applications. The most dominant operation in this cryptosystem is the scalar multiplication. In this paper, we study various scalar multiplication algorithms with respect to the efficiency, average hamming weight and memory requirements etc. This paper gives an idea and the areas for which the researchers can proceed further.
Other Latest Articles
- Evaluation of Enhanced K- MEAN Algorithm to the Student Dataset
- Throughput Analysis of Symmetric Algorithms
- A Study of Collaborative Filtering Approach for Temporal Dynamic Web Data
- Highly Efficient Design of DSP Systems Using Electronic Design Automation Tool to Find Iteration Bound
- Current Trends of High capacity Optical Interconnection Data Link in High Performance Optical Communication Systems
Last modified: 2015-12-03 16:15:23