Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point

Abstract

Cryptographic algorithms are becoming popular due to their applicability and suitability for use in constrained environment such as mobile sensor information applications. It is well known in these applications, both computing resources and power availability are limiting factors. Hence, it is expecting to have cryptographic algorithms with low power consuming, less computing, and high security for mobile sensor networks. Elliptic curve cryptography (ECC) is an emerging favorite because requires less computational power, communication bandwidth, and memory when compared to other cryptosystems. In this paper we present our new design, a hidden generator point, which offers an improvement in protection from the man-inmiddle (MinM) attack which is a major vulnerability for the sensor networks. Even though there are other ways to implement hidden generator point, which are on the way to be published in our future paper, the presented algorisms can show the hidden generator point does work. Also, a new algorithm based on ones complement for fast scalar multiplication is first introduced, which yields a 12.5% improvement in efficiency in comparison with the results of other common complementary algorithms reported