模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
模幂算法采用从右到左扫描指数的方法，可以使得两次模乘运算同时进行。
Modul ar exponentiation algorithm scans encryption from right to sot, so t wo modular multiplications can be processed parallelly.
算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
为了防御计时攻击，一般采用以“绑定法”为代表，影响运算性能的模幂算法。
The most widely accepted defense against timing attacks is to perform RSA blinding, which has a performance penalty.
为以较小的面积代价实现RSA公钥密码算法及其他一些算法所需的求模、模加、模乘、模幂等运算，该文设计了一种可作为协处理器使用的模运算处理器。
An area efficient modular arithmetic processor was developed that is capable of performing RSA public-key cryptography and other modular arithmetic operations as a coprocessor.
用常规的幂强化公式计算药筒在引伸后的强度时，数值偏低较多，原因是该公式未考虑引伸凹模锥角对强化的影响。
But the strength of the cartridge case after ironing drawing cannot be accurately calculated by this formula, because the result of calculation is lower than that reached in practice.
给出了整数的次数的一个计算公式，利用模素数的二次幂的次数计算该模素数的任意次幂的次数，是对以前文献的改进。
Given a computing formula for the integer's order, using the order of twice power of a prime, we computing the order of any power of the prime, to corrected relevant conclusion in previous document.
蒙哥马利算法对幂模运算的改进大大的提高了RSA的加解密效率。
The advancing of Montgomery algorithm for the computation power module greatly improves the RSA encryption efficiency.
目的研究任意多态叠加多模叠加态光场的广义非线性等幂次差压缩特性，从理论上导出该光场呈现高次差压缩的条件。
Aim To find out the squeezing conditions theoretically and the properties of equal-power nonlinear difference squeezing in multimode radiation field with any amount of states superposing studied.
目的研究任意多态叠加多模叠加态光场的广义非线性等幂次差压缩特性，从理论上导出该光场呈现高次差压缩的条件。
Aim To find out the squeezing conditions theoretically and the properties of equal-power nonlinear difference squeezing in multimode radiation field with any amount of states superposing studied.
应用推荐