模幂算法 Exponentiation algorithm ; modular-exponentiation operation
快速模幂运算 Fast Modular Exponentiation
幂律模型 [力] power law model ; Log-periodic Power-law model ; AMSAA model
幂律模式 power law method ; Power Low Model
大数模幂 fast modular exponentiation of large numbers
大数模幂乘 Modular Exponentiation of Multi-Precision Integer
毛细管幂律模型 capillary power-law model
对数周期幂律模型 LPPL
幂函数模型 power function model
Of course,to keep balance between speed and hardware resource, we also provide methods to realize modular multiplication and exponentiation with n/2+1 PEs,for which we have also provided comprehensive analysis.
当然,考虑到对速度和硬件资源的不同需求,我们也给出了使用n/2+1个 PE 来计算模乘、模幂的实现算法,并做出了相应的数据分析。
参考来源 - 分割式Montgomery模乘运算的线性高基心动阵列新结构 in C·2,447,543篇论文数据，部分数据来源于NoteExpress
模幂运算是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.
应用推荐