This follows the same idea as the decimal multiplication algorithm.
它使用的思想和十进制乘法算法的思想相同。
This paper presents a new fast scalar multiplication algorithm on elliptic curve cryptography.
基于椭圆曲线密码，提出了一种快速标量乘算法。
To resist the side channel attacks of elliptic curve cryptography, a new fast and secure point multiplication algorithm is proposed.
为了抵抗椭圆曲线密码的边信道攻击，提出了一种新型快速安全的标量乘算法。
With the help of word-based modular multiplication algorithm, the proposed multiplier is able to work with any precision of the input operands.
设计中采用了按字运算的模乘算法，使本设计具有很好的可扩展性，它可以完成任意位数的模乘运算。
In this paper, based on the analyzing and comparing some modular multiplication algorithms, we present a new modular multiplication algorithm on sliding window.
本文在分析比较现有快速模乘算法的基础上，提出了一个基于滑动窗口的快速模乘算法。
Through the finite domain multiplier design based on the polynomial multiplication theory in finite domain, a new simple multiplication algorithm in finite domain is introduced.
采用基于有限域中多项式乘法理论的快速有限域乘法器的设计，得到了简单的有限域上乘积运算算法。
This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.
此算法通过引入有符号和无符号滑动窗口编码方法，大大减少了标量乘算法中费时的加法运算次数。
This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.
此算法通过引入有符号和无符号滑动窗口编码方法，大大减少了标量乘算法中费时的加法运算次数。
应用推荐