projective Montgomery point multiplication algorithm 射影Montgomery点乘算法
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.
该算法比经典算法减少了点的加法的计算次数，从而加快了椭圆曲线上点的数乘的运算速度。
应用推荐