exponentiation

1. 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。
2. 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类进行任何表面更改。
3. Running this code verifies that exponentiation works ( modulo the bug I mentioned earlier), so half of the battle is now complete.
   运行这段代码确保可以求幂（忽略我之前提到的bug），这样就完成了一半的工作。
4. In this case, the exponentiation operator is another form of binary operator so the existing BinaryOp case class serves.
   在本例中，求幂运算符是另一种形式的二进制运算符，所以使用现有BinaryOpcase类就可以。
5. A Practical Fast Exponentiation Algorithm for Public key
   关于公开密钥的一种实用的快速取幂算法
6. Implementation of SPA Resistant RSA Exponentiation Algorithm
   抵御简单功耗分析的RSA模幂算法实现
7. First, computers have circuits for performing arithmetic operations, such as: addition, subtraction, division, multiplication and exponentiation.
   第一，计算机具有进行加、、、及取幂等各种算术运算的电路。
8. First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.
   综述了RSA密码算法中模幂运算的主要攻击方法及其防御措施。
9. A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.
   模乘幂运算是公钥密码体制中最常用的基本运算，提高其运算速度可有效地提高公钥密码算法的加解密效率。
10. If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack.
    如果我们运用求幂运算来加密和解密，对手就可以运用对数进行攻击。
11. On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
    定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
12. Modular exponentiation of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms.
    大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。
13. Read and analysis for the advanced research papers: fast exponentiation computation, multisignature, proxy signature, threshold signature, group signature, identification authentications, visitor control, Multisecret sharing.
    阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、（多）秘密共享。
14. The paper discusses how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculation speed of RSA.
    文章就如何改进大数乘幂算法和取余算法以提高RSA算法的运算速度进行了探讨。
15. 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的效率，具有一定的实用价值。
16. The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
    在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。
17. The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
    算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
18. 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.
    提出一种宏观累加模的快速模幂乘的算法，将乘法运算和求模运算转换成简单的移位运算和加法运算，从而避免了求模运算和减少大数相乘次数。
19. A hardware design for modular exponentiation of big number
    一种大数模幂的硬件实现设计
20. Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
    模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
21. 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约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。
22. The algorithm is useful to speed up the operation for some cryptographic protocols based on multiple exponentiation.
    此算法对基于多重取幂密码协议的快速运作是很有效用的。
23. The modular exponentiation part of the design is based on the M-ary arithmetic, which can save times of calculation.
    模幂部分基于M-ary算法，减少了所需模乘运算的次数。
24. 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动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。
25. A new fast dynamic combined modular exponentiation multiplication is presented.
    提出了一种新的动态组合RSA算法。
26. To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.
    通过一系列数学变换，将模幂运算变换成多次模乘运算。
27. 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.
    设计了一个高效的代理签名方案，和其他已提出的代理签名方案相比，它的签名算法没有计算量较重的模指数运算和配对运算，比较适合计算能力较弱的低端计算设备。
28. During the period of transforming, RSA should perform the modular exponentiation multiplication algorithm of large number.
    在变换过程中，RSA必需经历大数的模幂乘运算。
29. A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
    给出一个实例，在该实例中S盒的迭代远远快于模指数计算。
30. 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随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。

noun

1. the process of raising a quantity to some assigned power

   Synonym:    involution