ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

VLSI Implementation of Montgomery Multiplier in Finite Field Arithmetic for ECC over GF(2^163)

Journal: International Journal of Scientific Engineering and Technology (IJSET) (Vol.3, No. 8)

Publication Date:

Authors : ; ; ;

Page : 1102-1105

Keywords : Finite field Arithmetic; Montgomery Multiplier Elliptic Curve Cryptography; FPGA.;

Source : Downloadexternal Find it from : Google Scholarexternal


An efficient architecture for Finite Field Arithmetic with Montgomery multiplier is presented. Efficient implementation of Montgomery multiplier in the finite field arithmetic yields less area, power and delay. The advantage of ECC (Elliptic Curve Cryptography), it is more secure for wireless communication. Implemented with Xilinx ISE 13.2 and simulated with Modelsim.

Last modified: 2014-09-29 21:52:42