The Community for Technology Leaders
Green Image
ABSTRACT
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = Sigmaplusmntaua(tau-1)b and k = Sigmaplusmntaua(tau - mu)b(tau2 - mutau - 1)c. We prove that the number of terms in the second type is sublinear in the bit length of k, which leads to the first provably sublinear point multiplication algorithm on Koblitz curves. For the first type, we conjecture that the number of terms is sublinear and provide numerical evidence demonstrating that the number of terms is significantly less than that of tau-adic nonadjacent form expansions. We present details of an innovative FPGA implementation of our algorithm and performance data demonstrating the efficiency of our method. We also show that implementations with very low computation latency are possible with the proposed method because parallel processing can be exploited efficiently.
INDEX TERMS
field programmable gate arrays, cryptography,parallel processing, sublinear point multiplication, Koblitz curves, hardware implementation, multiple-base expansions, sublinear type, nonadjacent form expansions, FPGA implementation, performance data,sublinearity, Elliptic curve cryptography, Field-programmable gate arrays, Koblitz curves, multiple-base expansions, parallel processing,sublinearity, Elliptic curve cryptography, Field-programmable gate arrays, Koblitz curves, multiple-base expansions, parallel processing
CITATION
V.S. Dimitrov, K.U. Jarvinen, M.J. Jacobson, W. Chan, Zhun Huang, "Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation", IEEE Transactions on Computers, vol. 57, no. , pp. 1469-1481, November 2008, doi:10.1109/TC.2008.65
190 ms
(Ver 3.3 (11022016))