Short Memory Scalar Multiplication on Koblitz Curves
Short Memory Scalar Multiplication on Koblitz Curves
复制标题
DOI：
10.1007/11545262_7
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
K. Okeya;T. Takagi;Camille Vuillaume
中科院分区：
文献类型：
--
作者：
K. Okeya;T. Takagi;Camille Vuillaume
给出了一种计算Koblitz曲线上标量乘法的新方法。我们的方法与已知的最快技术一样快，但需要的内存要少得多。我们为我们的方法提出了两个设置。在非常适合硬件实现的第一种设置中，内存需求减少了85%。在第二种设置中，非常适合于软件实现，我们的技术将内存消耗减少了70%。因此，在使用更少的存储空间的情况下，所提出的方法与Koblitz曲线上最快的标量乘法方案具有相同的效率。
We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We propose two settings for our method. In the first setting, well-suited for hardware implementations, memory requirements are reduced by 85%. In the second setting, well-suited for software implementations, our technique reduces the memory consumption by 70%. Thus, with much smaller memory usage, the proposed method yields the same efficiency as the fastest scalar multiplication schemes on Koblitz curves.