Secure and compact implementation of optimized Montgomery multiplier based elliptic curve cryptography on FPGA with road vehicular traffic collecting protocol for VANET application
by S. Baskar; V.R. Sarma Dhulipala
International Journal of Heavy Vehicle Systems (IJHVS), Vol. 25, No. 3/4, 2018

Abstract: Nowadays, vehicular communication plays a crucial role in vehicular adhoc networks (VANET) because it helps to gather several details such as traffic, accident, vehicle identification etc. This paper introduces the road vehicular traffic collecting (RVTC) protocol for collecting the traffic information on roadside units. The collected information is transmitted to the users via the message. The main issue present in the communication process is security which leads to reduce the entire vehicular communication process and consumes high delay, energy and time. For overcoming these issues, optimized Montgomery multiplier implemented on Elliptic Curve Cryptography (ECC) is used and transmitted information has been encrypted by adding the carry select adder (CSLA) based modular operation process in Montgomery multiplier which reduces area overhead and information confidentiality with high security by consuming low energy. The efficiency of the system is evaluated through simulation results and targeted on Altera DE-2 FPGA (field programmable gate array).

Online publication date: Mon, 24-Sep-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Heavy Vehicle Systems (IJHVS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email