IJPAM: Volume 102, No. 3 (2015)

LOW COST ELLIPTIC CURVE SCALAR
MULTIPLICATION FOR CONSTRAINED DEVICES

Jayaprakash Kar
Information Security Research Group
Department of Information Systems
Faculty of Computing & Information Technology
King Abdulaziz University
KINGDOM OF SAUDI ARABIA


Abstract. This article proposes the technique to reduce the computation cost of scalar multiplication (SM) on elliptic curve for low processor constraints devices. Also the algorithm using the proposed technique secure against Side Channel Attack. There is no such algorithm is found to solve ECDLP in sub-exponential time. Equivalent strength of security is provided by ECC with shorter key size as compared to other Public key Cryptosystem. Therefore, ECC has acquired broad attention to research and development especially for low processor devices. Scalar multiplication on ECC operates on point doubling and adding. The secret the key stream consist of bit is `0' or `1'. While SM operate, doubling of points is followed by addition of points. This is a serious threat for low processor devices. For implementation, it is a challenge to develop algorithms that are not only efficient, but low cost.

Received: April, 4 2015

AMS Subject Classification:

Key Words and Phrases: ECDLP, constraint device, scalar multiplication, side channel attack

Download paper from here.




DOI: 10.12732/ijpam.v102i3.14 How to cite this paper?

Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2015
Volume: 102
Issue: 3
Pages: 579 - 592


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).