exponentiation
英
美
n. 取幂,求幂,乘方
英英释义
noun
- the process of raising a quantity to some assigned power
双语例句
- A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.
模乘幂运算是公钥密码体制中最常用的基本运算,提高其运算速度可有效地提高公钥密码算法的加解密效率。 - To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.
通过一系列数学变换,将模幂运算变换成多次模乘运算。 - Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。 - A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.
给出一个实例,在该实例中S盒的迭代远远快于模指数计算。 - The modular exponentiation part of the design is based on the M-ary arithmetic, which can save times of calculation.
模幂部分基于M-ary算法,减少了所需模乘运算的次数。 - In this case, the exponentiation operator is another form of binary operator so the existing BinaryOp case class serves.
在本例中,求幂运算符是另一种形式的二进制运算符,所以使用现有BinaryOpcase类就可以。 - 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.
提出一种宏观累加模的快速模幂乘的算法,将乘法运算和求模运算转换成简单的移位运算和加法运算,从而避免了求模运算和减少大数相乘次数。 - The algorithm is useful to speed up the operation for some cryptographic protocols based on multiple exponentiation.
此算法对基于多重取幂密码协议的快速运作是很有效用的。 - Implementation of SPA Resistant RSA Exponentiation Algorithm
抵御简单功耗分析的RSA模幂算法实现 - The paper discusses how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculation speed of RSA.
文章就如何改进大数乘幂算法和取余算法以提高RSA算法的运算速度进行了探讨。