1.【数】取幂
1.the multiplication of a number or quantity by itself a given number of times, the number of times being the power to which the number or quantity is to be raised
1.Running this code verifies that exponentiation works (modulo the bug I mentioned earlier), so half of the battle is now complete.
运行这段代码确保可以求幂（忽略我之前提到的bug），这样就完成了一半的工作。
2.First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.
综述了rsa密码算法中模幂运算的主要攻击方法及其防御措施。
3.The performance of RSA decryption has direct relationship with the efficiency of modular exponentiation implementation.
RSA算法的解密性能与大数模幂运算的实现效率有着直接的关系。
4.In this case, the exponentiation operator is another form of binary operator so the existing BinaryOp case class serves.
在本例中，求幂运算符是另一种形式的二进制运算符，所以使用现有BinaryOpcase类就可以。
5.Use to raise a value to a power (exponentiation).
用于对值进行幂运算（求幂）。
6.The Implementation and Optimization of Power Exponentiation in the Front End of Compiler
编译器前端乘幂运算的实现与优化
7.A Study on Multiple-precision Integer Efficient Modular Exponentiation Algorithm
多精度整数高效模幂运算算法的研究
8.Researching on Fast Modular Exponentiation of Larger- number with Large Exponents
大数模幂算法的分析与研究
9.When more than one exponentiation is performed in a single expression, the
如果在单个表达式中执行多个求幂运算，则按
10.The VLSI Implementation for Modular Exponentiation of Large Operands
大数模幂乘运算的VLSI实现