exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• 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 modular exponentiation part of the design is based on the M-ary arithmetic, which can save times of calculation.
  模幂部分基于M-ary算法，减少了所需模乘运算的次数。
• 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。
• On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
  定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
• 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随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。
• This paper introduced a method called "sliding-window" used in multiple-precision integer exponentiation arithmetic, and studied its application combined with Montgomery reduction, and how to calculate the "window size" related to the bits of the multiple-precision integer.
  介绍了多精度整数求幂运算中的“滑动窗口”算法，并结合Montgomery约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。
• Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
  模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
• 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的效率，具有一定的实用价值。
• Modular exponentiation of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms.
  大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。