exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• 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约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。
• 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随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。
• 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。
• Read and analysis for the advanced research papers: fast exponentiation computation, multisignature, proxy signature, threshold signature, group signature, identification authentications, visitor control, Multisecret sharing.
  阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、（多）秘密共享。
• The paper discusses how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculation speed of RSA.
  文章就如何改进大数乘幂算法和取余算法以提高RSA算法的运算速度进行了探讨。
• Modular exponentiation of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms.
  大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。
• This paper presents a new algorithm to realize modular exponentiation multiplication by converting multiplication and modular operation into the simple shift and addition operation, thus avoiding modular operation on large number.
  提出一种宏观累加模的快速模幂乘的算法，将乘法运算和求模运算转换成简单的移位运算和加法运算，从而避免了求模运算和减少大数相乘次数。
• A new fast dynamic combined modular exponentiation multiplication is presented.
  提出了一种新的动态组合RSA算法。
• To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.
  通过一系列数学变换，将模幂运算变换成多次模乘运算。
• If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
  如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。