TinyECCK

Efficient elliptic curve cryptography implementation over GF(2m) on 8-bit micaz mote

Seog Chung Seo, Dong Guk Han, Hyung Chan Kim, Seokhie Hong

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

In this paper, we revisit a generally accepted opinion: implementing Elliptic Curve Cryptosystem (ECC) over GF(2m) on sensor motes using small word size is not appropriate because XOR multiplication over GF(2 m) is not efficiently supported by current low-powered microprocessors. Although there are some implementations over GF(2m) on sensor motes, their performances are not satisfactory enough to be used for wireless sensor networks (WSNs). We have found that a field multiplication over GF(2m) are involved in a number of redundant memory accesses and its inefficiency is originated from this problem. Moreover, the field reduction process also requires many redundant memory accesses. Therefore, we propose some techniques for reducing unnecessary memory accesses. With the proposed strategies, the running time of field multiplication and reduction over GF(2163) can be decreased by 21.1% and 24.7%, respectively. These savings noticeably decrease execution times spent in Elliptic Curve Digital Signature Algorithm (ECDSA) operations (signing and verification) by around 15-19%. We present TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve - a kind of TinyOS package supporting elliptic curve operations) which is the first implementation of Koblitz curve on sensor motes as far as we know. Through comparisons with existing software implementations of ECC built in C or hybrid of C and inline assembly on sensor motes, we show that TinyECCK outperforms them in terms of running time, code size and supporting services. Furthermore, we show that a field multiplication over GF(2m) can be faster than that over GF(p) on 8-bit Atmega128 processor by comparing TinyECCK with TinyECC, a well-known ECC implementation over GF(p). TinyECCK with sect163k1 can generate a signature and verify it in 1.37 and 2.32 secs on aMicaz mote with 13,748-byte of ROM and 1,004-byte of RAM.

Original languageEnglish
Pages (from-to)1338-1347
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE91-D
Issue number5
DOIs
Publication statusPublished - 2008 May 1

Fingerprint

Cryptography
Sensors
Data storage equipment
Electronic document identification systems
ROM
Random access storage
Microprocessor chips
Wireless sensor networks

Keywords

  • Elliptic Curve Cryptosystem
  • Koblitz curve
  • TinyOS
  • Wireless sensor network

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

TinyECCK : Efficient elliptic curve cryptography implementation over GF(2m) on 8-bit micaz mote. / Seo, Seog Chung; Han, Dong Guk; Kim, Hyung Chan; Hong, Seokhie.

In: IEICE Transactions on Information and Systems, Vol. E91-D, No. 5, 01.05.2008, p. 1338-1347.

Research output: Contribution to journalArticle

@article{6ddd4335dc7b4367b92eb899b2ad4ed2,
title = "TinyECCK: Efficient elliptic curve cryptography implementation over GF(2m) on 8-bit micaz mote",
abstract = "In this paper, we revisit a generally accepted opinion: implementing Elliptic Curve Cryptosystem (ECC) over GF(2m) on sensor motes using small word size is not appropriate because XOR multiplication over GF(2 m) is not efficiently supported by current low-powered microprocessors. Although there are some implementations over GF(2m) on sensor motes, their performances are not satisfactory enough to be used for wireless sensor networks (WSNs). We have found that a field multiplication over GF(2m) are involved in a number of redundant memory accesses and its inefficiency is originated from this problem. Moreover, the field reduction process also requires many redundant memory accesses. Therefore, we propose some techniques for reducing unnecessary memory accesses. With the proposed strategies, the running time of field multiplication and reduction over GF(2163) can be decreased by 21.1{\%} and 24.7{\%}, respectively. These savings noticeably decrease execution times spent in Elliptic Curve Digital Signature Algorithm (ECDSA) operations (signing and verification) by around 15-19{\%}. We present TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve - a kind of TinyOS package supporting elliptic curve operations) which is the first implementation of Koblitz curve on sensor motes as far as we know. Through comparisons with existing software implementations of ECC built in C or hybrid of C and inline assembly on sensor motes, we show that TinyECCK outperforms them in terms of running time, code size and supporting services. Furthermore, we show that a field multiplication over GF(2m) can be faster than that over GF(p) on 8-bit Atmega128 processor by comparing TinyECCK with TinyECC, a well-known ECC implementation over GF(p). TinyECCK with sect163k1 can generate a signature and verify it in 1.37 and 2.32 secs on aMicaz mote with 13,748-byte of ROM and 1,004-byte of RAM.",
keywords = "Elliptic Curve Cryptosystem, Koblitz curve, TinyOS, Wireless sensor network",
author = "Seo, {Seog Chung} and Han, {Dong Guk} and Kim, {Hyung Chan} and Seokhie Hong",
year = "2008",
month = "5",
day = "1",
doi = "10.1093/ietisy/e91-d.5.1338",
language = "English",
volume = "E91-D",
pages = "1338--1347",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - TinyECCK

T2 - Efficient elliptic curve cryptography implementation over GF(2m) on 8-bit micaz mote

AU - Seo, Seog Chung

AU - Han, Dong Guk

AU - Kim, Hyung Chan

AU - Hong, Seokhie

PY - 2008/5/1

Y1 - 2008/5/1

N2 - In this paper, we revisit a generally accepted opinion: implementing Elliptic Curve Cryptosystem (ECC) over GF(2m) on sensor motes using small word size is not appropriate because XOR multiplication over GF(2 m) is not efficiently supported by current low-powered microprocessors. Although there are some implementations over GF(2m) on sensor motes, their performances are not satisfactory enough to be used for wireless sensor networks (WSNs). We have found that a field multiplication over GF(2m) are involved in a number of redundant memory accesses and its inefficiency is originated from this problem. Moreover, the field reduction process also requires many redundant memory accesses. Therefore, we propose some techniques for reducing unnecessary memory accesses. With the proposed strategies, the running time of field multiplication and reduction over GF(2163) can be decreased by 21.1% and 24.7%, respectively. These savings noticeably decrease execution times spent in Elliptic Curve Digital Signature Algorithm (ECDSA) operations (signing and verification) by around 15-19%. We present TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve - a kind of TinyOS package supporting elliptic curve operations) which is the first implementation of Koblitz curve on sensor motes as far as we know. Through comparisons with existing software implementations of ECC built in C or hybrid of C and inline assembly on sensor motes, we show that TinyECCK outperforms them in terms of running time, code size and supporting services. Furthermore, we show that a field multiplication over GF(2m) can be faster than that over GF(p) on 8-bit Atmega128 processor by comparing TinyECCK with TinyECC, a well-known ECC implementation over GF(p). TinyECCK with sect163k1 can generate a signature and verify it in 1.37 and 2.32 secs on aMicaz mote with 13,748-byte of ROM and 1,004-byte of RAM.

AB - In this paper, we revisit a generally accepted opinion: implementing Elliptic Curve Cryptosystem (ECC) over GF(2m) on sensor motes using small word size is not appropriate because XOR multiplication over GF(2 m) is not efficiently supported by current low-powered microprocessors. Although there are some implementations over GF(2m) on sensor motes, their performances are not satisfactory enough to be used for wireless sensor networks (WSNs). We have found that a field multiplication over GF(2m) are involved in a number of redundant memory accesses and its inefficiency is originated from this problem. Moreover, the field reduction process also requires many redundant memory accesses. Therefore, we propose some techniques for reducing unnecessary memory accesses. With the proposed strategies, the running time of field multiplication and reduction over GF(2163) can be decreased by 21.1% and 24.7%, respectively. These savings noticeably decrease execution times spent in Elliptic Curve Digital Signature Algorithm (ECDSA) operations (signing and verification) by around 15-19%. We present TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve - a kind of TinyOS package supporting elliptic curve operations) which is the first implementation of Koblitz curve on sensor motes as far as we know. Through comparisons with existing software implementations of ECC built in C or hybrid of C and inline assembly on sensor motes, we show that TinyECCK outperforms them in terms of running time, code size and supporting services. Furthermore, we show that a field multiplication over GF(2m) can be faster than that over GF(p) on 8-bit Atmega128 processor by comparing TinyECCK with TinyECC, a well-known ECC implementation over GF(p). TinyECCK with sect163k1 can generate a signature and verify it in 1.37 and 2.32 secs on aMicaz mote with 13,748-byte of ROM and 1,004-byte of RAM.

KW - Elliptic Curve Cryptosystem

KW - Koblitz curve

KW - TinyOS

KW - Wireless sensor network

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

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

U2 - 10.1093/ietisy/e91-d.5.1338

DO - 10.1093/ietisy/e91-d.5.1338

M3 - Article

VL - E91-D

SP - 1338

EP - 1347

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 5

ER -