exponentiation

英

美

n.  取幂，求幂，乘方

计算机

英英释义

noun

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

双语例句

• The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
  算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
• 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。
• First, computers have circuits for performing arithmetic operations, such as: addition, subtraction, division, multiplication and exponentiation.
  第一，计算机具有进行加、、、及取幂等各种算术运算的电路。
• 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 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的效率，具有一定的实用价值。
• 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.
  提出一种宏观累加模的快速模幂乘的算法，将乘法运算和求模运算转换成简单的移位运算和加法运算，从而避免了求模运算和减少大数相乘次数。
• Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
  模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
• 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.
  设计了一个高效的代理签名方案，和其他已提出的代理签名方案相比，它的签名算法没有计算量较重的模指数运算和配对运算，比较适合计算能力较弱的低端计算设备。
• A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
  给出一个实例，在该实例中S盒的迭代远远快于模指数计算。
• To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.
  通过一系列数学变换，将模幂运算变换成多次模乘运算。