The point multiplication on Koblitz curves using multiple base expansions of the form $k=Sum pm tau^a(tau-1)^b$ & $k = Sum pm tau^a( tau-1)^b ( tau^2 ¨C tau ¨C 1)^c.$. In this paper the number of terms in the second type is sublinear in the bit length of $k$, which lead to first provably sublinear point multiplication algorithm on Koblitz curves. Elliptic curve scalar multiplication is the central operation in elliptic graph cryptography. But these paper presents to accelerate scalar multiplications on Koblitz curve. In this paper we are implementing to use low power technique
展开▼
机译：Koblitz曲线上的点乘法使用形式为$ k = Sum pm tau ^ a（tau-1）^ b $和$ k = Sum pm tau ^ a（tau-1）^ b（tau ^ 2¨ C tau-C 1）^ c。$。在本文中，第二种类型的项数在$ k $的位长中是次线性的，这导致了在Koblitz曲线上的第一个可证明的次线性点乘法算法。椭圆曲线标量乘法是椭圆图密码学的核心操作。但是这些论文提出了加速Koblitz曲线上的标量乘法。在本文中，我们正在实现使用低功耗技术
展开▼
