模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
公钥密码算法RS A主要是依赖于大数的因数分解的困难性建立的。
Public key RSA mainly depends on the establishment of the factorization difficulty of a big integer.
通过分析几种常用的公钥密码算法，归纳了一组最常用的基本模运算指令。
Based on the analysis of public-key algorithms, a set of the most frequently used modular operations, called basic operations, is abstracted.
应用推荐