
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

TinyECCK16: An Efficient Field Multiplication Algorithm on 16bit Environment and Its Application to Tmote Sky Sensor Motes
Seog Chung SEO DongGuk HAN Seokhie HONG
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E92D
No.5
pp.918928 Publication Date: 2009/05/01 Online ISSN: 17451361
DOI: 10.1587/transinf.E92.D.918 Print ISSN: 09168532 Type of Manuscript: Special Section PAPER (Special Section on Information and Communication System Security) Category: Implementation Issues Keyword: wireless sensor network, elliptic curve cryptosystem, efficient implementation,
Full Text: PDF>>
Summary:
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 8bit to 16bit or 32bit, 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 lefttoright (ltr) comb method which is widely used as an efficient multiplication algorithm over GF(2^{m}) suitable for extended word sizes and present TinyECCK16 (Tiny Elliptic Curve Cryptosystem with Koblitz curve on 16bit word) which is implemented with the proposed multiplication algorithm on 16bit Tmote Sky mote. The proposed algorithm is faster than typical ltr comb method by 15.06% and the 16bit version of the algorithm proposed in TinyECCK by 5.12% over GF(2^{163}).

