To resist the side channel attacks of elliptic curve cryptography, a new fast and secure point multiplication algorithm is proposed.
为了抵抗椭圆曲线密码的边信道攻击，提出了一种新型快速安全的标量乘算法。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
The algorithm can greatly reduce the number of elliptic point addition, so the efficiency of scalar multiplication in elliptic curves is improved.
该算法比经典算法减少了点的加法的计算次数，从而加快了椭圆曲线上点的数乘的运算速度。
To improve the efficiency of the algorithm of point multiplication on elliptic curves is a key problem.
提高椭圆曲线点积运算的效率是椭圆曲线研究的一个核心问题。
Secondly, it analyzed ECC and how to improve the algorithm efficiency from the point of Times-dot algorithm and scalar multiplication algorithm.
其次文章详细论述了ECC的相关知识及从倍点乘算法和标量乘运算两方面来提高该算法的运算效率。
On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
应用推荐