exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• A Practical Fast Exponentiation Algorithm for Public key
  关于公开密钥的一种实用的快速取幂算法
• Read and analysis for the advanced research papers: fast exponentiation computation, multisignature, proxy signature, threshold signature, group signature, identification authentications, visitor control, Multisecret sharing.
  阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、（多）秘密共享。
• Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
  模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
• 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 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.
  提出一种宏观累加模的快速模幂乘的算法，将乘法运算和求模运算转换成简单的移位运算和加法运算，从而避免了求模运算和减少大数相乘次数。
• 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约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。
• If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
  如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。
• 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.
  设计了一个高效的代理签名方案，和其他已提出的代理签名方案相比，它的签名算法没有计算量较重的模指数运算和配对运算，比较适合计算能力较弱的低端计算设备。
• A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.
  模乘幂运算是公钥密码体制中最常用的基本运算，提高其运算速度可有效地提高公钥密码算法的加解密效率。
• A new fast dynamic combined modular exponentiation multiplication is presented.
  提出了一种新的动态组合RSA算法。