摘要：Recently, the resu lt of Tiny ECCK (Tin y Ellip tic Cu rv e C ryp tosystem with Ko blitz cu rv e) sho ws thatb oth field m ultiplicatio n and redu ctio n o ver GF(2 m) are related to a heav y amo unt o f d uplicated memo ryaccess es and that redu cin g the n umb er of these dup lications n oticeably imp ro ves th e perfo rmance of elliptics cu rv e op erations su ch as scalar multiplications, signin g an d verificatio n. However, in case that theu nderlying wo rd s ize is expand ed from 8 -b it to 16-bit or 32 -bit, the efficiency o f the prop osed tech niqu esin TinyECCK is decreased b ecause th e nu mber of m em ory accesses to lo ad o r store an element in GF(2 m)is almo st halved. Th erefore, in th is paper, we p ro pose a tech niqu e which mak es left-to-rig ht comb methods uitable on exp an ded word sizes and p resent th e p erform an ce o f TinyECCK16 wh ich is implemented withth e propo sed multip lication alg orith m. With the p ro posed multiplication algo rithm , 1 7-23% o f run ning timein elliptic curv e operatio ns su ch as scalar mu ltiplicatio n, signin g and verificatio n is sav ed. Furth ermo re,Tiny ECCK16 is sup erior to ex is tin g ECC so ftwares implemented on 16 -b it Tmote Sk y sensor mote withregard s to runn in g time and m em ory requ irement. Tiny ECC K1 6 with 5TNAF can generate a sig nature andv erify it within 0.81 and 1.35secs with 14,42 2-b yte of ROM and 1,750 -b yte of RAM
关键词：Sen sor Network; Elliptic Curve Cryp tography ; TinyOS
