exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• A new fast dynamic combined modular exponentiation multiplication is presented.
  提出了一种新的动态组合RSA算法。
• 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动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。
• To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.
  通过一系列数学变换，将模幂运算变换成多次模乘运算。
• The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
  算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
• 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 window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
  在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。
• 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.
  提出一种宏观累加模的快速模幂乘的算法，将乘法运算和求模运算转换成简单的移位运算和加法运算，从而避免了求模运算和减少大数相乘次数。
• 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.
  设计了一个高效的代理签名方案，和其他已提出的代理签名方案相比，它的签名算法没有计算量较重的模指数运算和配对运算，比较适合计算能力较弱的低端计算设备。
• 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约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。
• First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.
  综述了RSA密码算法中模幂运算的主要攻击方法及其防御措施。