期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2015
卷号：75
期号：1
出版社：Journal of Theoretical and Applied
摘要：Scalar multiplication is the most computational intensive operation in elliptic curve cryptosystem (ECC). Improving the performance of this operation can be achieved by using recoding technique which aims at minimizing the density of nonzero digits in the scalar, also known as its Hamming weight. We proposed X-Tract recoding technique that alters the representation of scalar from binary digit to {-1,0,1,3} digit set in non-adjacent form (NAF). The recoding algorithm can be expressed both mathematically and logically and reduces the Hamming weight of the scalar to 41% in average for 163-bit scalar with balanced bit. X-Tract Recoding algorithm reads every three adjacent bits overlapped by one bit from left-to-right in the input binary scalar to produce each new output digit. We use ANOVA analysis to show that the new recoding technique produces significantly better output with less Hamming weight compared to its counterparts.
关键词：Elliptic Curve Cryptosystem; Scalar Multiplication; Recoding; Hamming Weight; Non-Adjacent Form
