New key agreement techniques for sensor networks

We propose two computationally efficient key agree-ment algorithms. The schemes are ideally suited for computa-tionally constrained environments such as sensor networks. The first proposed technique is general and uses matrix factorization. We provide constructive algorithms to implement the scheme. The second algorithm uses commutative property of matrices to distribute keys and provides two different keys per node pair. Both the algorithms are practical in terms of implementation, security provided and linear in computational complexity.