exponentiation
英
美
n. 取幂，求幂，乘方
英英释义
noun
- the process of raising a quantity to some assigned power
双语例句
- 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 of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms.
大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。 - 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随机数发生器和侧信道原子化技术应用于改进的算法中，得到侧信道原子化的严格自随机化模幂算法。 - First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.
综述了RSA密码算法中模幂运算的主要攻击方法及其防御措施。 - 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约简算法，对“滑动窗口”算法进行了应用研究，分析了根据多精度整数的位数来确定相应的窗口大小。 - On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。 - Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。 - Running this code verifies that exponentiation works ( modulo the bug I mentioned earlier), so half of the battle is now complete.
运行这段代码确保可以求幂（忽略我之前提到的bug），这样就完成了一半的工作。 - A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
给出一个实例，在该实例中S盒的迭代远远快于模指数计算。