exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

• the process of raising a quantity to some assigned power
  Synonym:involution

双语例句

• For example, let's add a new operator to the language, the^ operator, which will perform exponentiation; in other words, 2^ 2 is2 squared or4.
  例如，我们向这种语言添加一个新的运算符，即^运算符，它将执行求幂运算；也就是说，2^2等于2的平方或4。
• To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.
  通过一系列数学变换，将模幂运算变换成多次模乘运算。
• Based on analyses of self-randomized modular exponentiation algorithm, a new side-channel atomic strict self-randomized modular exponentiation algorithm is proposed in which a BBS random number generator and the side-channel atomic technology are applied to improve the original algorithm.
  通过对自随机化模幂算法的分析，提出将BBS随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。
• During the period of transforming, RSA should perform the modular exponentiation multiplication algorithm of large number.
  在变换过程中，RSA必需经历大数的模幂乘运算。
• The algorithm is useful to speed up the operation for some cryptographic protocols based on multiple exponentiation.
  此算法对基于多重取幂密码协议的快速运作是很有效用的。
• The research of this paper has using value, improving the processing of encryption and decryption by fast implementation of modular exponentiation and modular multiplication algorithm.
  RSA算法的快速实现是现代密码学研究的方向之一，本文研究表明通过改进公钥密码体制中的模幂乘算法，可以进一步提高RSA的效率，具有一定的实用价值。
• The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
  在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。
• We designed a highly efficient proxy signature scheme. Compared with other scheme, it needs no modular exponentiation and pairing in the signing algorithm. Thus, it is suitable for the low end devices.
  设计了一个高效的代理签名方案，和其他已提出的代理签名方案相比，它的签名算法没有计算量较重的模指数运算和配对运算，比较适合计算能力较弱的低端计算设备。
• The paper discusses how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculation speed of RSA.
  文章就如何改进大数乘幂算法和取余算法以提高RSA算法的运算速度进行了探讨。
• Running this code verifies that exponentiation works ( modulo the bug I mentioned earlier), so half of the battle is now complete.
  运行这段代码确保可以求幂（忽略我之前提到的bug），这样就完成了一半的工作。