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约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。
• If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
  如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。
• A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
  给出一个实例，在该实例中S盒的迭代远远快于模指数计算。
• A hardware design for modular exponentiation of big number
  一种大数模幂的硬件实现设计
• Read and analysis for the advanced research papers: fast exponentiation computation, multisignature, proxy signature, threshold signature, group signature, identification authentications, visitor control, Multisecret sharing.
  阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、（多）秘密共享。
• A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.
  模乘幂运算是公钥密码体制中最常用的基本运算，提高其运算速度可有效地提高公钥密码算法的加解密效率。
• First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.
  综述了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随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。
• The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
  算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
• 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动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。