(An important exception is the notation for exponentiation: x raised to the power y is conveniently written as x**y).
（一个重要的不同是指数的表示法：为了方便，x 的y 次幂写为 x**y ）。
In this case, the exponentiation operator is another form of binary operator so the existing BinaryOp case class serves.
在本例中，求幂运算符是另一种形式的二进制运算符，所以使用现有BinaryOp case类就可以。
Running this code verifies that exponentiation works (modulo the bug I mentioned earlier), so half of the battle is now complete.
运行这段代码确保可以求幂（忽略我之前提到的bug），这样就完成了一半的工作。
Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
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.
这些公钥密码算法的关键操作为大整数模幂乘操作与椭圆曲线标量乘法操作，均属于计算密集型运算。
We need to know how hard it is to reverse the exponentiation.
我们需要知道求幂运算的逆运算的难度。
If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。
The performance of RSA decryption has direct relationship with the efficiency of modular exponentiation implementation.
RSA算法的解密性能与大数模幂运算的实现效率有着直接的关系。
The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
Exponentiation, which normally has higher precedence than addition or multiplication, is evaluated last in this example because the other expressions are enclosed in parentheses.
通常比加法或乘法具有更高优先级的求幂在此示例中最后计算，因为其他表达式都放在括号中。
Exponentiation, which normally has higher precedence than addition or multiplication, is evaluated last in this example because the other expressions are enclosed in parentheses.
通常比加法或乘法具有更高优先级的求幂在此示例中最后计算，因为其他表达式都放在括号中。
应用推荐