exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• The paper discusses how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculation speed of RSA.
  文章就如何改进大数乘幂算法和取余算法以提高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随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。
• A hardware design for modular exponentiation of big number
  一种大数模幂的硬件实现设计
• Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
  模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
• Read and analysis for the advanced research papers: fast exponentiation computation, multisignature, proxy signature, threshold signature, group signature, identification authentications, visitor control, Multisecret sharing.
  阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、（多）秘密共享。
• On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
  定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
• 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.
  提出一种宏观累加模的快速模幂乘的算法，将乘法运算和求模运算转换成简单的移位运算和加法运算，从而避免了求模运算和减少大数相乘次数。
• Running this code verifies that exponentiation works ( modulo the bug I mentioned earlier), so half of the battle is now complete.
  运行这段代码确保可以求幂（忽略我之前提到的bug），这样就完成了一半的工作。
• The modular exponentiation part of the design is based on the M-ary arithmetic, which can save times of calculation.
  模幂部分基于M-ary算法，减少了所需模乘运算的次数。
• It is shown by time complexity that the new algorithm obtains the speed improvement of encryption and decryption compared with the modular exponentiation by the repeated squaring method.
  文章给出一种新的RSA的快速算法，结合模n和底数a对指数m动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。