exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.
  模乘幂运算是公钥密码体制中最常用的基本运算，提高其运算速度可有效地提高公钥密码算法的加解密效率。
• A new fast dynamic combined modular exponentiation multiplication is presented.
  提出了一种新的动态组合RSA算法。
• On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
  定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
• The modular exponentiation part of the design is based on the M-ary arithmetic, which can save times of calculation.
  模幂部分基于M-ary算法，减少了所需模乘运算的次数。
• If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
  如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。
• A hardware design for modular exponentiation of big number
  一种大数模幂的硬件实现设计
• A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
  给出一个实例，在该实例中S盒的迭代远远快于模指数计算。
• In this case, the exponentiation operator is another form of binary operator so the existing BinaryOp case class serves.
  在本例中，求幂运算符是另一种形式的二进制运算符，所以使用现有BinaryOpcase类就可以。
• 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。
• Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
  模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。