exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• First, computers have circuits for performing arithmetic operations, such as: addition, subtraction, division, multiplication and exponentiation.
  第一，计算机具有进行加、、、及取幂等各种算术运算的电路。
• If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
  如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。
• Notice how here the fact that we added exponentiation to the system has been done in effectively six lines of code with zero surface change to the rest of the Calc class.
  注意，这里我们只使用6行代码就有效地向系统添加了求幂运算，同时没有对Calc类进行任何表面更改。
• 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.
  在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。
• Implementation of SPA Resistant RSA Exponentiation Algorithm
  抵御简单功耗分析的RSA模幂算法实现
• A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.
  模乘幂运算是公钥密码体制中最常用的基本运算，提高其运算速度可有效地提高公钥密码算法的加解密效率。
• Modular exponentiation of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms.
  大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。
• The research of this paper has using value, improving the processing of encryption and decryption by fast implementation of modular exponentiation and modular multiplication algorithm.
  RSA算法的快速实现是现代密码学研究的方向之一，本文研究表明通过改进公钥密码体制中的模幂乘算法，可以进一步提高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动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。