| 面向PKCS的快速模运算算法 |
| |
| 引用本文： | 何奇. 面向PKCS的快速模运算算法[J]. 信息安全与通信保密, 1994, 0(2) |
| |
| 作者姓名： | 何奇 |
| |
| 作者单位： | 清华大学计算机科学与技术系 北京 |
| |
| 摘 要： | 本文根据PKCS(Public Key Cryptosystem)中大数运算的特点,提出了一套模运算的双表算法,并基于数论理论,就该算法的基础及其复杂性给出了完善的证明。整套算法的基本思想是:以空间换取时间。其建预表的递推方法大大地提高了建表效率,并且两个表都直接参与模运算,显著地提高了运算效率。
|
| 关 键 词： | 模运算 初步模运算 同阶模运算 算法 复杂性 PKCS |
A Fast Algorithm of Modular Arithmetic for PKCS |
| |
| He Qi. A Fast Algorithm of Modular Arithmetic for PKCS[J]. China Information Security, 1994, 0(2) |
| |
| Authors: | He Qi |
| |
| Affiliation: | Dept. of Computer Science & Technology Tsing hua University Beijing 100084 |
| |
| Abstract: | A fast algorithm of modular arithmetic for PKCS is proposed. With the ideal of trading space and time, modular arithmetic can be finished fast by this algorithm based on two tables of residue obtained by precomputation. In addition, the theory for this algorithm is proved systematically and its comp lexity is analyzed completely. |
| |
| Keywords: | modular arithmetic initial modular algorithm further modular algorithm algorithm complexity PKCS |
| 本文献已被 CNKI 等数据库收录！ |
