Elliptic Curve Cryptography implementation on FPGA using Montgomery multiplication for equal key and data size over GF(2m) for Wireless Sensor Networks

Leelavathi, G. and Shaila, K. and Venugopal, K.R. (2016) Elliptic Curve Cryptography implementation on FPGA using Montgomery multiplication for equal key and data size over GF(2m) for Wireless Sensor Networks. 2016 IEEE Region 10 Conference (TENCON). pp. 468-471. ISSN 2159-3450

Full text not available from this repository.
Official URL: http://10.1109/TENCON.2016.7848043

Abstract

In public key cryptography, RSA algorithm has been used for a long time, but it does not meet the constraints of WSNs. Elliptic Curve Cryptography(ECC) has been employed recently because of its high security for same length bit. ECC point multiplication operation is time consuming which affects the speed of encryption and decryption of data. In this paper, we propose the point multiplication using Montgomery multiplication technique that achieves considerable speed and with reduced area utilization. The ECC is first simulated on different FPGA devices, with key length 112 and 163 bits and the area-speed tradeoff is compared. ECC algorithm is implemented with software and hardware choosing Artix 7 XC7a100t-3csg324 FPGA which supports key lengths of 112 and 163 bits. The proposed ECC algorithm is modeled using VHDL and synthesized on Spartan 3 and 6, Virtex 4, 5 and 6 and Artix 7 before the …

Item Type: Article
Uncontrolled Keywords: Elliptic curve cryptography , Wireless sensor networks , Encryption , Field programmable gate arrays , Hardware
Subjects: Faculty of Engineering > Computer Science & Information Science Engineering
Divisions: University Visvesvarayya College of Engineering > Department of Computer Science and Information Science Engineering
Depositing User: Ms Laxmi Kamble
Date Deposited: 15 Sep 2021 10:10
Last Modified: 15 Sep 2021 10:10
URI: http://eprints-bangaloreuniversity.in/id/eprint/9558

Actions (login required)

View Item View Item