Montgomery algorithm is the most popular method for modular multiplication in RSA systems.
蒙哥马利算法是在RSA密码系统中广泛应用的模乘法算法。
A new bit-serial modular multiplication based on optimal normal and shifted canonical was presented.
研究中提出了新的基于正规基和正则基的比特串行模乘算法实现方案。
To design some efficient modular multiplication algorithms has now been one of focus of research and study of application field.
设计高效的模乘算法也成为密码应用领域关注和研究的焦点之一。
With the help of word-based modular multiplication algorithm, the proposed multiplier is able to work with any precision of the input operands.
设计中采用了按字运算的模乘算法，使本设计具有很好的可扩展性，它可以完成任意位数的模乘运算。
The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
It is proved that the speeds of modular multiplication and inversion method are both improved by performing 113 bits and 191 bits methods on TMS320C6201.
在TMS320C 6201上执行113位和191位算法证实确实提高了模乘和模逆两种运算的速度。
In this paper, based on the analyzing and comparing some modular multiplication algorithms, we present a new modular multiplication algorithm on sliding window.
本文在分析比较现有快速模乘算法的基础上，提出了一个基于滑动窗口的快速模乘算法。
The implementation of operators for modular multiplication over the Finite Fields adopts an improved serial structure, considering the trade-off between size and speed.
有限域运算的实现中模乘运算使用改进的串行结构以达到面积与速度的合理匹配。
Experimental results show that, the modular multiplication instruction and hardware unit presented in this paper can achieve high performance and guarantee high flexibility.
实验结果表明，该有限域模乘指令和硬件运算单元具有较高的执行效率和较好的灵活性。
Analysis of finite field modular multiplication requirement of Elliptic Curve Cryptography (ECC), the application specific instruction for modular multiplication computation is designed in this paper.
针对椭圆曲线密码算法中有限域模乘运算的需求，提出其专用模乘指令。
Using multinomial radix, the modular square will be finished in one period of the clock, which is faster than using the point multiplication directly.
根据模平方运算自身的特点，选用了多项式基进行运算，使模平方运算在一个时钟周期完成，比直接调用模乘运算提高一半以上的速度。
In these public key cryptographic algorithms, the kernel operations are modular exponentiation of multi-precision integer and elliptic curve scalar multiplication, which both are computing intensive.
这些公钥密码算法的关键操作为大整数模幂乘操作与椭圆曲线标量乘法操作，均属于计算密集型运算。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
应用推荐