English translation for "指数运算"
|
- exponent arithmetic
Related Translations:
变换运算: commutative operation 运算环境: operating environment 运算程序: operating programoperational programoperational sequenceoperator routineproduction program 运算迅速: operational readiness 运算变量: operational variable 概率运算: probabilistic operations 区间运算: intervallarithmetik interval arithmetic
- Example Sentences:
| 1. | At the same time , it is relatively colorfully that this paper makes use of some proverties of topological spaces to discuss the problems about countable ordinal exponentiation arithmetic
同时，本文用拓扑空间的一些性质来讨论集合论中的可数序数指数运算问题也比较精彩。 | | 2. | For the module index calculation . the " square multiply " algorithm has been highly improved compared with the " module multiply " algorithm . the " square multiply " has been widely used in the rsa algorithm
在模指数运算方面： “平方一乘”算法较之模乘算法性能有很大的进步，是rsa中的模指数运算的较为通用的算法。 | | 3. | Read and analysis for the advanced research papers : fast exponentiation computation , multisignature , proxy signature , threshold signature , group signature , identification authentications , visitor control , multisecret sharing
阅读并讨论专题论文：快速指数运算、多重签名、代理签名、门限签名、群签名、身份认证、访问控制、 （多）秘密共享。 | | 4. | It is provably secure in the random oracle paradigm and its computation cost is just one exponent and one multiplication together with on addition at the signer side and the online computation is one multiplication together with one addition
它在随机oracle模式下是安全的且签名方进行签名只需要一次指数运算一次模乘运算一次加法运算。在线计算量则只需一次乘法和一次加法，因而非常高效且适合智能卡的应用。 | | 5. | So , we put forward an optimized exponential algorithm in which the multiplication with itself was substituted mostly by square . through expanding of composition fields , the time consuming of optimal algorithm is , where n is the number of bits of exponential
通过对算法的分析我们可以得出结论，随着复合域的不断增大，域上指数运算所需的时间可近似表示为，式中n为指数以二进制表示时的比特串长度，为域元素进行多项式相乘所需的时间。 | | 6. | The latter pay special attention to the software implementation environments , including the technical details such as programming interface , data structures and 32 - bits visual c + + inline assembler . a sorftware packet is designed and implemented at last , which can perform the modular multiplication with equal 2048 - bits long of modulu and operands within approximately 5 . 239ms and the modular exponentiation with equal 2048 - bits long of modulu , exponent and base within approximately 4290 . 559ms
经测试，在intelceleron400mhz ， ram64mb的pc机上，进行一次乘数与被乘数的最大位数均为2048位长的模乘运算所需平均时间约为5 . 239ms ，在进行一次底数和指数的最大位数均为2048位长的模指数运算所需的平均时间约为4290 . 559ms 。 |
- Similar Words：
- "指数因子" English translation, "指数音量衰减" English translation, "指数映射" English translation, "指数有理性法则" English translation, "指数预托证券" English translation, "指数运算子" English translation, "指数暂存器溢位错失" English translation, "指数增长" English translation, "指数增长函数" English translation, "指数增长模型" English translation
|
|
|
