Study and analysis of data security using elliptic curve cryptography over prime field

Abstract

The all pervading nature of communication networks has paved the way for the development of wireless and internet applications making communication possible all over the world With the explosion of networks and the huge amount of data transmitted along securing the data content is becoming more and more important The idea of data security leads to the evolution of cryptography With the fast development of cryptography research and computer technology elliptic curve cryptography is gaining more importance because of its small key size over the existing cryptosystems This thesis focuses on enhancing security of data in network oriented applications newlineusing elliptic curve cryptography over finite prime field The thesis initially commences with the implementation of elliptic curve cryptography by transforming the message into an affine point on the elliptic curve over the finite prime field Transformation of the plaintext ASCII value by using an affine point and introducing the modified random newlinenumber generator are the contributions of the present work These steps introduce nonlinearity in the character of the message thereby completely disguising its identity from the hacker even before the message is encrypted It also illustrates the process of encryption decryption of a text message and image files in spatial domain by enhancing security using comparative linear congruential generator for better random number generation The state space complexity is very high so that the intruders will not be able to interpret the encrypted message newline newline newline