During the period of transforming, RSA should perform the modular exponentiation multiplication algorithm of large number.

SEA: A High-Performance Modular Long Integer Exponentiation Coprocessor

一种高性能大数模幂协处理器SEA

First countermeasures for the exponentiation computation of RSA cryptographic algorithm were summarized.

综述了RSA密码算法中模幂运算的主要攻击方法及其防御措施。

The modular exponentiation part of the design is based on the M-ary arithmetic, which can save times of calculation.

模幂部分基于M-ary算法，减少了所需模乘运算的次数。

At the latter level, students can understand the exponential function as a process of exponentiation and can derive the properties of exponential function.

过程水平组的学生将指数函数理解为取幂的过程，并能推理出函数性质。

The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.

在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。

The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.

算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。

Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.

模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。

On the Theorem of Averaging Exponentiation and Application

幂均定理及其应用

The large number exponentiation algorithms is the key of RSA Cryptography System, which is performed by a series of modular multiplication.

RSA算法的核心运算是大整数模幂运算，而模幂运算是由一系列的模乘运算构成。

A concrete instance is presented in which the S-Box iteration is much less time-consuming than modular exponentiation.

给出一个实例，在该实例中S盒的迭代远远快于模指数计算。

A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.

模乘幂运算是公钥密码体制中最常用的基本运算，提高其运算速度可有效地提高公钥密码算法的加解密效率。

Optimal Window Method for Fast Exponentiation

快速幂乘运算的最优Window法

The paper discusses how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculation speed of RSA.

文章就如何改进大数乘幂算法和取余算法以提高RSA算法的运算速度进行了探讨。

Study on Fast Exponentiation of Large Integer

大整数指数快速算法研究

To transform the Modular Exponentiation into multiple Modular Multiplication by a series of mathematical derivation.

通过一系列数学变换，将模幂运算变换成多次模乘运算。

The main factor that affects the calculation speed of RSA encryption is the exponentiation calculation and the modular calculation on large numbers.

而影响其运算速度的主要因素是大数乘幂算法和取余算法。

Fast Modular Exponentiation Algorithm and Its Hardware Implementation

快速模幂算法及其硬件实现

A Modular Exponentiation Algorithm Based on Variable Radix

基于底数可变特性的模幂乘算法

A new fast dynamic combined modular exponentiation multiplication is presented.

提出了一种新的动态组合RSA算法。

A Study on Multiple-precision Integer Efficient Modular Exponentiation Algorithm

多精度整数高效模幂运算算法的研究