TY - GEN
T1 - A pseudo-pipelined VLSI architecture of two elliptic curve scalar multiplications
AU - Xu, Wang
AU - Yan, Zhang
PY - 2009
Y1 - 2009
N2 - Two elliptic curve scalar multiplications (ECMLT) are used in some important elliptic curve encryption algorithms, a pseudo-pipelined VLSI architecture of two ECMLTs over GF(2m) is proposed for these algorithms. The proposed architecture includes three word-serial finite field (FF) multipliers, and each FF multiplier has word size w. Implemented using FPGA, two ECMLTs are computed in approximately 4⌈m/w⌉(m-l) clock cycles in the proposed architecture. Compared with the architectures proposed by other authors recently, it is shown that the computation time for two ECMLTs is the shortest by using our proposed architecture.
AB - Two elliptic curve scalar multiplications (ECMLT) are used in some important elliptic curve encryption algorithms, a pseudo-pipelined VLSI architecture of two ECMLTs over GF(2m) is proposed for these algorithms. The proposed architecture includes three word-serial finite field (FF) multipliers, and each FF multiplier has word size w. Implemented using FPGA, two ECMLTs are computed in approximately 4⌈m/w⌉(m-l) clock cycles in the proposed architecture. Compared with the architectures proposed by other authors recently, it is shown that the computation time for two ECMLTs is the shortest by using our proposed architecture.
UR - https://www.scopus.com/pages/publications/77949602569
U2 - 10.1109/EDSSC.2009.5394270
DO - 10.1109/EDSSC.2009.5394270
M3 - 会议稿件
AN - SCOPUS:77949602569
SN - 9781424442980
T3 - 2009 IEEE International Conference on Electron Devices and Solid-State Circuits, EDSSC 2009
SP - 258
EP - 261
BT - 2009 IEEE International Conference on Electron Devices and Solid-State Circuits, EDSSC 2009
T2 - 2009 IEEE International Conference on Electron Devices and Solid-State Circuits, EDSSC 2009
Y2 - 25 December 2009 through 27 December 2009
ER -