Protecting from Attacking the Man-in-Middle in Wireless Sensor Networks with Elliptic Curve Cryptography Key Exchange

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 them, which requires less computational power, communication bandwidth, and memory in comparison with other cryptosystem. In particularly, in order to save pre-computing there is a trend for sensor networks to design a sensor-group-leader rather than every sensor node communicates to the end database, which indicated the needs to prevent from the man-in-the middle attacking. In this paper we first present an algorithm that we called “hidden generation point” ECC protocol to protecting the ECC key exchange system from the man-in-middle attacking in wireless sensor networks. Even though there are other ways to be investigated, which will published in other paper, the major contribution in this paper is showing the hidden generation point” works. Also it is noted that the agent technology provides a method for handling increasing software complexity and supporting rapid and accurate decision making. A multi-agent applying for key exchange is motioned even the further discussed will be presented in another paper as the major task of this paper is presenting “hidden generation point.”

[1]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[2]  Michael Scott,et al.  Optimal Irreducible Polynomials for GF(2m) Arithmetic , 2007, IACR Cryptol. ePrint Arch..

[3]  Brian Logan,et al.  The distributed simulation of multiagent systems , 2001, Proc. IEEE.

[4]  B. Logan,et al.  The Distributed Simulation of Multi-Agent Systems , 2000 .

[5]  N. Koblitz Elliptic curve cryptosystems , 1987 .

[6]  Laurent Imbert,et al.  Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains , 2005, ASIACRYPT.

[7]  Atsuko Miyaji,et al.  Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.

[8]  Bo Sheng,et al.  Elliptic curve cryptography-based access control in sensor networks , 2006, Int. J. Secur. Networks.

[9]  Huanguo Zhang,et al.  An Efficient Elliptic Curves Scalar Multiplication for Wireless Network , 2007, 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007).

[10]  Marc Joye,et al.  Trading Inversions for Multiplications in Elliptic Curve Cryptography , 2006, Des. Codes Cryptogr..

[11]  Viviana Mascardi,et al.  Comparing environments for developing software agents , 2002, AI Commun..

[12]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[13]  Christophe Doche,et al.  Double-Base Number System for Multi-Scalar Multiplications , 2009, IACR Cryptol. ePrint Arch..

[14]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[15]  Khalid Kaabneh,et al.  Key Exchange Protocol in Elliptic Curve Cryptography with No Public Point , 2005 .

[16]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[17]  Hui Chen,et al.  Fast Implementation for Modular Inversion and Scalar Multiplication in the Elliptic Curve Cryptography , 2008, 2008 Second International Symposium on Intelligent Information Technology Application.