取幂 meaning in Chinese
exponentiation
Examples
- First , computers have circuits for performing arithmetic operations , such as : addition , subtraction , division , multiplication and exponentiation
第一，计算机具有进行加、减、乘、除及取幂等各种算术运算的电路。 - First , computer has circuit which can perform arithmetic operations , such as addition , subtraction , multiplication , division , and a quantity to a power
第一，计算机有执行算术运算的电路，如：加、减、乘、除和取幂。 - Most overheads of an ot protocol are modular exponentiations that are computationally intensive tasks . by expanding from one - out - of - two ot protocol to one - out - n ot protocol and combining n one - out - of - two ot protocol to one one - out - n ot protocol , define a new simultaneous one - out - n ot protocol , and the number of modular exponentiation is consequently reduced to small constant
由于ot协议的计算开销主要集中在计算密集的取幂运算，通过扩展二选一ot协议为n选一ot协议，把n个二选一ot调用合并成单个n选一ot调用，并在此基础上定义新的并发ot协议，使取幂运算次数减少为常数次。 - One special feature of this paper is that it provides fast implementation means for the all kinds of modular exponentiation algorithms , which facilitate the implementation of the rsa public key algorithms . the paper improved the sliding window algorithm by largely reducing the space complexity . meanwhile this paper represents an efficient combined algorithm to improve the processing of encryption and decryption
大数模幂乘运算是实现rsa等公钥密码的基本运算,其运行效率决定了rsa公钥密码的性能,文章主要研究了各种模幂算法的快速实现方法,提出运用组合算法的思想来减少算法运行时间;并对滑动窗口取幂算法进行了部分改进,用线性表来存储预计算数据,从而减少了算法的复杂度,进一步提高了rsa加/解密的效率,并在试验测试中得到较为满意的结果。