Enhancement of security in wireless sensor networks using Elliptic Curve Cryptography

Today's security systems have been drawing great attentions as cryptographic algorithms have gained popularity due to the nature that make them suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. Elliptic Curve Cryptography (ECC) is one of the algorithms which require less computational power, communication bandwidth and memory when compared with other cryptosystems. A group of points are generated by using the Elliptic Curve Cryptography and a graphical analysis has been plotted to show the number of points generated by a particular prime number. Different analysis has been done based on different values of a, b and different prime numbers. For protecting from Man in the Middle attack in Elliptic Curve Cryptography, we assumed a generator point by some agreement between the two parties. An algorithm has been developed to calculate the complexity of using different generator points. Another group of points are also generated by using the Galois field (GF). By picking up a point from the Galois field as a generator point, complexity has been calculated. An analysis has been done by using the complexities of different generator points by using ECC and Galois Field. The results are obtained in order to figure out the secure cryptographic algorithm to pick the generator point.