Abstract: Elliptic Curve Cryptography (ECC) has established itself as the most preferred and secured cryptography algorithm for the secure data transfer and secure data storage in embedded system environment. Efficient implementation of point multiplication algorithm is crucial activity for designing area efficient, low footprint ECC cryptoprocessors. In this paper, an area efficient implementation of double point multiplication algorithm over binary elliptic curve is presented. Area analysis of double point multiplication algorithm based on differential addition chains method is carried out and area report is generated. Area optimization is achieved by using pipelined structure and by reutilizing idle resources from previous stages in processing unit. The proposed architecture for double point multiplication is implemented on Xilinx Virtex-4 FPGA device. Architecture is modeled in verilog-HDL and synthesized using Xilinx ISE 14.1 design software and is found to be more efficient in terms of area than the existing such architectures.

Sunil Devidas Bobade and Dr.Vijay R. Mankar, “Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm” International Journal of Advanced Computer Science and Applications(IJACSA), 6(4), 2015. http://dx.doi.org/10.14569/IJACSA.2015.060404

@article{Bobade2015,
title = {Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2015.060404},
url = {http://dx.doi.org/10.14569/IJACSA.2015.060404},
year = {2015},
publisher = {The Science and Information Organization},
volume = {6},
number = {4},
author = {Sunil Devidas Bobade and Dr.Vijay R. Mankar}
}