Key Predistribution Technique based on Matrix Decomposition in Wireless Sensor Network

Abstract

In many applications wireless sensor networks are used and are installed in hostile environment for sensing different data. To secure data, cryptographic techniques are used. The sensor nodes in the network are distributed randomly in the network and these communicate with the node present within the range of the node. In order to have secure communication by maintaining confidentiality and authentication, key predistribution technique is used. Key predistribution also reduces the memory overhead of storing the key information in the sensor node. In this method key is predistributed in the network before communication. The paper proposes key predistribution method based on matrix decomposition technique known as Cholesky decomposition technique. In this method the key matrix decomposes into lower and upper triangular matrix. The upper triangular matrix is the transpose of lower triangular matrix. Each node stores the row and column information. The nodes involve in communication exchange the row information of the decomposed matrix to generate the secret key which is used for secure message communication. This method provides better key connectivity and also needs less memory to store the polynomial store in the node to generate the key.