Analysis of RSA Cryptosystem to Secure Messages in Vehicular Adhoc Network
Keywords:
Public Key Management system, VANETAbstract
Due to increasing rate of accidents as per World Health Organisation, it is required to provide safety in Vehicals. Even if provided safety features in vehicals such as airbags, safety belts , still rate of accidents ratio not reduced. Most of accidents occurers at intersection points. If preincident information about incident received then motorist may take decision along the path . But , difficulty is that if such messages are not secured among vehicals in network then attacker may broadcast wrong information in network for personal benefits or for just fun which may be life threatning to other users in network as other users decisions in network depends only on messages received.
Hence, Security of such Network is important. In this paper, tried to analyse the performance of RSA Cryptographic algorithms in terms of Delay. i. e. time required to generate keys , time requird for signature Generation & Signature Verification . Finally conclude wheather RSA cryptosystem is suitable for Vehicular adhoc network Communication or Not.
Downloads
References
Sasikumar p , Vivek c , Jayakrishnan p.,“Key-Management Systems in Vehicular Ad-hoc Networks”, in international journal of computer applications (0975 – 8887) volume 10– no.1, november 2010.
Yogesh A. Suryawanshi , Avichal Kapur,”Security and Privacy Preservation in Vanet”, international journal of information technology and knowledge management january-june 2011, volume 4, no. 1, pp. 125-128
Yi Qian , and Nader Moayeri, “Design Secure and Application-Oriented Vanet” , National Institute of Standards and Technology 100 bureau drive, stop 8920 gaithersburg, md 20899-8920, USA
Ahren Studer, Elaine Shi, Fan Bai, & Adrian Perrig, “Tacking Together Efficient Authentication, Revocation, and Privacy in Vanets”, carnegie Mellon university general motors
Soyoung Park, Baber Aslam, Damla Turgut, Cliff C. Zou, “Defense Against Sybil Attack in Vehicular Ad hoc Network Based on Roadside Unit Support”,School of Electrical Engineering and Computer Science University of Central Florida 4000 Central Florida Blvd. Orlando, FL 32816-2362
Nasser Mozayani, Maryam Barzegar, Hoda madani, “Strategies for Securing Safety Messages with Fixed Key Infrastructure in Vehicular Network” , world academy of science, engineering and technology 48 2008
M. Raya and j.-p. Hubaux, “Securing Vehicular Ad hoc Networks”, j. Computer security, special issue on security, ad hoc and sensor networks, vol. 15, no. 1, 2007
X. lin, r. lu, c. zhang, h. zhu, p.h. ho, and x. shen,"Security in Vehicular Ad hoc Networks", ieee communications magazine, vol. 46, no. 4, 88-95, 2008
A Stampoulis and Z chai, “a survey of security in vehicular networks” yale university
Abedi, o, Fathy, m, and Taghiloo, j “Enhancing Aodv Routing Protocol Using Mobility Parameters in Vanet”, computer systems and applications, 2008
S. D. Ram churn, D. Huynh, and N. R. Jennings, “Trust in Multi-agent Systems”, the knowledge engineering review, vol. 19, no. 1, pp. 1–25, 2004.
Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw Hill Education Private Limited, 4th Edition.
Coron Jean-Sebastien and Weger Benne de, “Hardness of the Main Computational Problems Used in Cryptography”, Information Society, 2007.
Dan Calloway, “Introduction to Cryptography and its role in Network Security Principles and Practices”, 2009, available at http://www.dancalloway.com/.
David M. Burton, “Elementary Number Theory”, University of Hampshire, Universal Book Stall, New Delhi, 2nd Edition.
Hinek M. J., “Another look at small RSA exponents”, Springer, New York, 2006, pp. 82–98.
Hinek M. Jason., “On the Security of Some Variants of RSA”, Waterloo, Ontario, Canada : s.n., 2007.
Kaliski Burt, “The Mathematics of the RSA Public-Key Cryptosystem”, RSA , Laborataries.
Ou Huayin and Wei Baodian, “Multi-factor Rebalanced RSA-CRT Encryption Schemes”, IEEE, 2009.
Peng Jiezhao and Wu Qi, Research and Implementation of RSA Algorithm in Java”, IEEE, 2008.
RSA Laboratories, “Why RSA?”, available at
http://www.rsa.com/rsalabs/node.asp?id= 2222 and
http://www.rsa.com/rsalabs/node.asp?id=2223.
Shen Guicheng, Liu, Bingwu and Zheng, Xuefeng, “Research on Fast Implementation of RSA with Java”, International Symposium on Web Information Systems and Applications (WISA’09), Acadaemy Publisher,Nanchang, China, 2009, pp. 186-189.
Shoup Victor, “Why Chosen Ciphertext Security Matters”, IBM Research Division, 2005.
Stallings William, “Cryptography and Network Security - Principles and Practices”. India : Pearson Prentice Hall, 4th Edition.
Sun H., “Dual RSA and its Security Analysis”, IEEE Transactions on Information Theory, 2007, pp. 2922-2933.
Sun H.-M. and C.-T. Yang, “RSA with balanced short exponents and its application to entity authentication in Public Key Cryptology”, Springer, NewYork, 2005, pp. 199–215.
Sun H.-M. and Wu M.-E., “An approach towards Rebalanced RSA-CRT with short public exponent Cryptology”, s.l. : ePrint Archive, 2005.
Xie Jianquan, “A practical method for generating big primes quickly”, Information Security and Communication Secrecy, 2006, pp. 56-58.
Yang Shuqun, “An algorithm for generating strong primes”, Science and Technology Square, 2006, pp. 74-75.
Yingxiong Xiao and Shaohua Zhang, “The Determination and Generation of a kind of Strong Primes”, Science and Technology Square, 2006, pp. 74-75.
Zheng Ziwei and Li Cuihua, “Realization of Class-Based RSA System”, Journal of Huaqiao University (Natural Science), 2003.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.