Lecture Notes in Computer Science
DOI: 10.1007/978-3-540-77690-1_19
|View full text |Cite
|
Sign up to set email alerts
|

NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks

Abstract: Abstract. By using Elliptic Curve Cryptography (ECC), it has been recently shown that Public-Key Cryptography (PKC) is indeed feasible on resource-constrained nodes. This feasibility, however, does not necessarily mean attractiveness, as the obtained results are still not satisfactory enough. In this paper, we present results on implementing ECC, as well as the related emerging field of Pairing-Based Cryptography (PBC), on two of the most popular sensor nodes. By doing that, we show that PKC is not only viable… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
128
0
12

Publication Types

Select...
6
3
1

Relationship

2
8

Authors

Journals

citations
Cited by 234 publications
(141 citation statements)
references
References 45 publications
1
128
0
12
Order By: Relevance
“…We used mainly C code and some assembly language to speed up our time critical arithmetic routines (in particular binary polynomial multiplication). On our most constrained 8-bit MICAz device we were able to compute the pairing in 2.66s -a time comparable with the scalar point multiplication operation presented in [21]. The whole key agreement takes as little as 0.1s on Imote2 and 4.27s in the worst case on the most constrained mote.…”
Section: Resultsmentioning
confidence: 87%
“…We used mainly C code and some assembly language to speed up our time critical arithmetic routines (in particular binary polynomial multiplication). On our most constrained 8-bit MICAz device we were able to compute the pairing in 2.66s -a time comparable with the scalar point multiplication operation presented in [21]. The whole key agreement takes as little as 0.1s on Imote2 and 4.27s in the worst case on the most constrained mote.…”
Section: Resultsmentioning
confidence: 87%
“…Most schemes provide encrypting capabilities based on a secret key shared among nodes, either in software [43] or hardware level [44], [45]. In addition, notable advances have been observed in the implementation of Elliptic Curve Cryptography (ECC) [46], [47], which has emerged as a promising alternative to RSA-based algorithms, guaranteeing the same level of security, 18 while employing a much smaller key size. To overcome the limitations of traditional symmetric cryptography in wireless networks, biometrics [48], [49] exploit particular physiological values of the patient's body in order to provide efficient cryptographic techniques in WBANs, thus gaining significant ground in healthcare environments.…”
Section: ) Challengesmentioning
confidence: 99%
“…That is, it requires less than half the amount of time of the quickest previous result [40], which takes 10.96s to compute pairings. This is mainly due to our faster binary field multiplication.…”
Section: B Performancementioning
confidence: 99%