Informatics Publishing Limited

Shemina A. Karim ¹, Reneesh C. Zacharia ¹, Rijo Sebastian ¹

Affiliations
1 Department of Electronics and Communication Engineering, Mangalam College of Engineering, Kerala, IN

Abstract

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.

Keywords

Finite Field Arithmetic, Montgomery Multiplier Elliptic Curve Cryptography, FPGA.

Full Text