Very efficient point multiplication on Koblitz curves

IEICE Electronics Express

Turki F. Al-Somani¹ 

[1] Umm Al-Qura University, Computer Engineering Department

关键词: cryptoprocessor;    elliptic curve cryptography (ECC);    field-programmable gate array (FPGA);    Koblitz curves;    parallel processing;    point multiplication;   

DOI  :  10.1587/elex.13.20160044

学科分类：电子、光学、磁材料

来源: Denshi Jouhou Tsuushin Gakkai

【 摘 要 】

References(19)This paper presents a very efficient scheme for point multiplication on Koblitz curves. The proposed scheme reduces the critical path in the data dependency graph of the point addition operation and increases the utilization of the three parallel multipliers that are used. The proposed scheme exploits an idle multiplier to perform an extra field operation that will be needed in the next iteration. Furthermore, the proposed scheme is implemented on an Altera Stratix II EP2S180F1020C3 FPGA over GF(2163) and compared with the related parallel schemes in the literature. The results show that the proposed scheme outperforms the previous schemes in terms of the area-time (AT) and AT2 products. Accordingly, the proposed scheme is very attractive for use in high-performance applications.

【 授权许可】

Unknown