In these public key cryptographic algorithms, the kernel operations are modular exponentiation of multi-precision integer and elliptic curve scalar multiplication, which both are computing intensive.
这些公钥密码算法的关键操作为大整数模幂乘操作与椭圆曲线标量乘法操作，均属于计算密集型运算。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
Analysis of finite field modular multiplication requirement of Elliptic Curve Cryptography (ECC), the application specific instruction for modular multiplication computation is designed in this paper.
针对椭圆曲线密码算法中有限域模乘运算的需求，提出其专用模乘指令。
Analysis of finite field modular multiplication requirement of Elliptic Curve Cryptography (ECC), the application specific instruction for modular multiplication computation is designed in this paper.
针对椭圆曲线密码算法中有限域模乘运算的需求，提出其专用模乘指令。
应用推荐