exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.
  综述了RSA密码算法中模幂运算的主要攻击方法及其防御措施。
• In this case, the exponentiation operator is another form of binary operator so the existing BinaryOp case class serves.
  在本例中，求幂运算符是另一种形式的二进制运算符，所以使用现有BinaryOpcase类就可以。
• The algorithm is useful to speed up the operation for some cryptographic protocols based on multiple exponentiation.
  此算法对基于多重取幂密码协议的快速运作是很有效用的。
• The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
  在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。
• For example, let's add a new operator to the language, the^ operator, which will perform exponentiation; in other words, 2^ 2 is2 squared or4.
  例如，我们向这种语言添加一个新的运算符，即^运算符，它将执行求幂运算；也就是说，2^2等于2的平方或4。
• Read and analysis for the advanced research papers: fast exponentiation computation, multisignature, proxy signature, threshold signature, group signature, identification authentications, visitor control, Multisecret sharing.
  阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、（多）秘密共享。
• First, computers have circuits for performing arithmetic operations, such as: addition, subtraction, division, multiplication and exponentiation.
  第一，计算机具有进行加、、、及取幂等各种算术运算的电路。
• A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
  给出一个实例，在该实例中S盒的迭代远远快于模指数计算。
• Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
  模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
• Modular exponentiation of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms.
  大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。