New key agreement techniques for sensor networks

Abhishek Parakh, Subhash Kak

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)15-21
Number of pages7
JournalInfocommunications Journal
Volume7
Issue number1
StatePublished - Mar 1 2015

Fingerprint

Sensor networks
Factorization
Computational complexity

Keywords

  • Key distribution
  • Matrix fac-torization
  • Sensor networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

New key agreement techniques for sensor networks. / Parakh, Abhishek; Kak, Subhash.

In: Infocommunications Journal, Vol. 7, No. 1, 01.03.2015, p. 15-21.

Research output: Contribution to journalArticle

@article{f4276b58b7074f73af589784d22dd53a,
title = "New key agreement techniques for sensor networks",
abstract = "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.",
keywords = "Key distribution, Matrix fac-torization, Sensor networks",
author = "Abhishek Parakh and Subhash Kak",
year = "2015",
month = "3",
day = "1",
language = "English (US)",
volume = "7",
pages = "15--21",
journal = "Infocommunications Journal",
issn = "2061-2079",
publisher = "Scientific Association for Infocommunications",
number = "1",

}

TY - JOUR

T1 - New key agreement techniques for sensor networks

AU - Parakh, Abhishek

AU - Kak, Subhash

PY - 2015/3/1

Y1 - 2015/3/1

N2 - 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.

AB - 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.

KW - Key distribution

KW - Matrix fac-torization

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=84943624831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84943624831&partnerID=8YFLogxK

M3 - Article

VL - 7

SP - 15

EP - 21

JO - Infocommunications Journal

JF - Infocommunications Journal

SN - 2061-2079

IS - 1

ER -