International Journal of Scientific Engineering and Technology

Open Access Open Access  Restricted Access Subscription Access

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


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

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.
User
Notifications
Font Size

Abstract Views: 135

PDF Views: 0




  • VLSI Implementation of Montgomery Multiplier in Finite Field Arithmetic for ECC Over GF (2∧163)

Abstract Views: 135  |  PDF Views: 0

Authors

Shemina A. Karim
Department of Electronics and Communication Engineering, Mangalam College of Engineering, Kerala, India
Reneesh C. Zacharia
Department of Electronics and Communication Engineering, Mangalam College of Engineering, Kerala, India
Rijo Sebastian
Department of Electronics and Communication Engineering, Mangalam College of Engineering, Kerala, India

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.