标题:High performance FPGA implementation of elliptic curve cryptography over binary fields
作者:Liu, Shuai ;Ju, Lei ;Cai, Xiaojun ;Jia, Zhiping ;Zhang, Zhiyong
通讯作者:Jia, Zhiping
作者机构:[Liu, Shuai ;Ju, Lei ;Cai, Xiaojun ;Jia, Zhiping ;Zhang, Zhiyong ] School of Computer Science and Technology, Shandong University, Jinan, China
会议名称:13th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2014
会议日期:24 September 2014 through 26 September 2014
来源:Proceedings - 2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2014
出版年:2015
页码:148-155
DOI:10.1109/TrustCom.2014.23
关键词:Binary fields; Elliptic curve cryptography; Field-programmable gate array; Polynomial basis
摘要:In this paper, we propose a high performance hardware implementation architecture of elliptic curve scalar multiplication over binary fields. The proposed architecture is based on the Montgomery ladder method and uses polynomial basis for finite field (FF) arithmetic. A single Karatsuba multiplier runs with no idle cycle significantly increases the performance of FF multiplication while spending small amount of hardware resources, and other FF operations performed in parallel with the FF multiplier. The optimized circuits lead to a lesser area requirement compared to other high performance implementations. An implementation for the National Institute of Standards and Technology (NIST) recommended curve with degree 163 is shown, the proposed design can reach 121 MHz with 10,417 slices when implemented on Xilinx Virtex-4 XC4VLX200 FPGA device, the total time required for one elliptic curve scalar multiplication is 9.0 s. © 2014 IEEE.
收录类别:EI;SCOPUS
Scopus被引频次:10
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922960300&doi=10.1109%2fTrustCom.2014.23&partnerID=40&md5=81e40884f7c5a9dc4f4f1692d76b8c1b
TOP