Welcome to the resource topic for 2006/305
Title:
Provably Sublinear Point Multiplication on Koblitz Curves and its Hardware Implementation
Authors: V. S. Dimitrov, K. U. Jaervinen, M. J. Jacobson Jr., W. F. Chan, Z. Huang
Abstract:We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = \sum \pm \tau^a (\tau-1)^b and k= \sum \pm \tau^a (\tau-1)^b (\tau^2 - \tau - 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 non-adjacent form expansions. We present details of an innovative FPGA implementation of our algorithm and performance data demonstrating the efficiency of our method.
ePrint: https://eprint.iacr.org/2006/305
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .