TinyECCK16: An efficient field multiplication algorithm on 16-bit environment and its application to Tmote Sky sensor motes

Seog Chung Seo, Dong Guk Han, Seokhie Hong

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Recently, the result of TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve) shows that both field multiplication and reduction over GF(2 m) are related to a heavy amount of duplicated memory accesses and that reducing the number of these duplications noticeably improves the performance of elliptic curve operations such as scalar multiplications, signing and verification. However, in case that the underlying word size is extended from 8-bit to 16-bit or 32-bit, the efficiency of the techniques proposed in TinyECCK is decreased because the number of memory accesses to load or store an element in GF(2 m) is significantly reduced. Therefore, in this paper, we propose a technique which makes left-to-right (ltr) comb method which is widely used as an efficient multiplication algorithm over GF(2m) suitable for extended word sizes and present TinyECCK16 (Tiny Elliptic Curve Cryptosystem with Koblitz curve on 16-bit word) which is implemented with the proposed multiplication algorithm on 16-bit Tmote Sky mote. The proposed algorithm is faster than typical ltr comb method by 15.06% and the 16-bit version of the algorithm proposed in TinyECCK by 5.12% over GF(2 163).

Original languageEnglish
Pages (from-to)918-928
Number of pages11
JournalIEICE Transactions on Information and Systems
VolumeE92-D
Issue number5
DOIs
Publication statusPublished - 2009 Dec 1

Fingerprint

Cryptography
Sensors
Data storage equipment

Keywords

  • Efficient implementation
  • Elliptic Curve Cryptosystem
  • Wireless sensor network

ASJC Scopus subject areas

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

Cite this

TinyECCK16 : An efficient field multiplication algorithm on 16-bit environment and its application to Tmote Sky sensor motes. / Seo, Seog Chung; Han, Dong Guk; Hong, Seokhie.

In: IEICE Transactions on Information and Systems, Vol. E92-D, No. 5, 01.12.2009, p. 918-928.

Research output: Contribution to journalArticle

@article{d2ce989d095b4a07bdc5cb6731ea4927,
title = "TinyECCK16: An efficient field multiplication algorithm on 16-bit environment and its application to Tmote Sky sensor motes",
abstract = "Recently, the result of TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve) shows that both field multiplication and reduction over GF(2 m) are related to a heavy amount of duplicated memory accesses and that reducing the number of these duplications noticeably improves the performance of elliptic curve operations such as scalar multiplications, signing and verification. However, in case that the underlying word size is extended from 8-bit to 16-bit or 32-bit, the efficiency of the techniques proposed in TinyECCK is decreased because the number of memory accesses to load or store an element in GF(2 m) is significantly reduced. Therefore, in this paper, we propose a technique which makes left-to-right (ltr) comb method which is widely used as an efficient multiplication algorithm over GF(2m) suitable for extended word sizes and present TinyECCK16 (Tiny Elliptic Curve Cryptosystem with Koblitz curve on 16-bit word) which is implemented with the proposed multiplication algorithm on 16-bit Tmote Sky mote. The proposed algorithm is faster than typical ltr comb method by 15.06{\%} and the 16-bit version of the algorithm proposed in TinyECCK by 5.12{\%} over GF(2 163).",
keywords = "Efficient implementation, Elliptic Curve Cryptosystem, Wireless sensor network",
author = "Seo, {Seog Chung} and Han, {Dong Guk} and Seokhie Hong",
year = "2009",
month = "12",
day = "1",
doi = "10.1587/transinf.E92.D.918",
language = "English",
volume = "E92-D",
pages = "918--928",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - TinyECCK16

T2 - An efficient field multiplication algorithm on 16-bit environment and its application to Tmote Sky sensor motes

AU - Seo, Seog Chung

AU - Han, Dong Guk

AU - Hong, Seokhie

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Recently, the result of TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve) shows that both field multiplication and reduction over GF(2 m) are related to a heavy amount of duplicated memory accesses and that reducing the number of these duplications noticeably improves the performance of elliptic curve operations such as scalar multiplications, signing and verification. However, in case that the underlying word size is extended from 8-bit to 16-bit or 32-bit, the efficiency of the techniques proposed in TinyECCK is decreased because the number of memory accesses to load or store an element in GF(2 m) is significantly reduced. Therefore, in this paper, we propose a technique which makes left-to-right (ltr) comb method which is widely used as an efficient multiplication algorithm over GF(2m) suitable for extended word sizes and present TinyECCK16 (Tiny Elliptic Curve Cryptosystem with Koblitz curve on 16-bit word) which is implemented with the proposed multiplication algorithm on 16-bit Tmote Sky mote. The proposed algorithm is faster than typical ltr comb method by 15.06% and the 16-bit version of the algorithm proposed in TinyECCK by 5.12% over GF(2 163).

AB - Recently, the result of TinyECCK (Tiny Elliptic Curve Cryptosystem with Koblitz curve) shows that both field multiplication and reduction over GF(2 m) are related to a heavy amount of duplicated memory accesses and that reducing the number of these duplications noticeably improves the performance of elliptic curve operations such as scalar multiplications, signing and verification. However, in case that the underlying word size is extended from 8-bit to 16-bit or 32-bit, the efficiency of the techniques proposed in TinyECCK is decreased because the number of memory accesses to load or store an element in GF(2 m) is significantly reduced. Therefore, in this paper, we propose a technique which makes left-to-right (ltr) comb method which is widely used as an efficient multiplication algorithm over GF(2m) suitable for extended word sizes and present TinyECCK16 (Tiny Elliptic Curve Cryptosystem with Koblitz curve on 16-bit word) which is implemented with the proposed multiplication algorithm on 16-bit Tmote Sky mote. The proposed algorithm is faster than typical ltr comb method by 15.06% and the 16-bit version of the algorithm proposed in TinyECCK by 5.12% over GF(2 163).

KW - Efficient implementation

KW - Elliptic Curve Cryptosystem

KW - Wireless sensor network

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

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

U2 - 10.1587/transinf.E92.D.918

DO - 10.1587/transinf.E92.D.918

M3 - Article

AN - SCOPUS:77950316310

VL - E92-D

SP - 918

EP - 928

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 5

ER -