| Fast VLSI Implementation of Modular Inversion in Galois Field GF（p） |
| |
| 引用本文： | 周涛,吴行军,白国强,陈弘毅.Fast VLSI Implementation of Modular Inversion in Galois Field GF（p）[J].清华大学学报,2003,8(5):628-632. |
| |
| 作者姓名： | 周涛 吴行军 白国强 陈弘毅 |
| |
| 作者单位： | InstituteofMicroelectronics,TsinghuaUniversity,Beijing100084,China |
| |
| 基金项目： | Supported by the Prom otion Plan of the Ministry of E-ducation and the National Natural Science Foundationof China(No.2 0 0 2 AA14 10 4 0 ) |
| |
| 摘 要： | Modular inversion is one of the key arithmetic operations in public key cryptosystems, so low-cost,high-speed hardware implementation is absolutely necessary. This paper presents an algorithm for prime fields for hardware implementation. The algorithm involves only ordinary addition/subtraction and does not need any modular operations, multiplications or divisions. All of the arithmetic operations in the algorithm can be accomplished by only one adder, so it is very suitable for fast very large scale integration (VLSI) implementation. The VLSI implementation of the algorithm is also given with good performance and low silicon penalty.
|
| 关 键 词： | 超大规模集成电路 公共密钥加密系统 有限域 模数转换 算术运算 |
Fast VLSI Implementation of Modular Inversion in Galois Field GF(p) |
| |
| ZHOU Tao,WU Xingjun,BAI Guoqiang,CHEN HongyiInstitute of Microelectronics,Tsinghua University,Beijing ,China.Fast VLSI Implementation of Modular Inversion in Galois Field GF(p)[J].Tsinghua Science and Technology,2003,8(5):628-632. |
| |
| Authors: | ZHOU Tao WU Xingjun BAI Guoqiang CHEN HongyiInstitute of Microelectronics Tsinghua University Beijing China |
| |
| Institution: | ZHOU Tao,WU Xingjun,BAI Guoqiang,CHEN HongyiInstitute of Microelectronics,Tsinghua University,Beijing 100084,China |
| |
| Abstract: | Modular inversion is one of the key arithmetic operations in public key cryptosystems, so low-cost, high-speed hardware implementation is absolutely necessary. This paper presents an algorithm for prime fields for hardware implementation. The algorithm involves only ordinary addition/subtraction and does not need any modular operations, multiplications or divisions. All of the arithmetic operations in the algorithm can be accomplished by only one adder, so it is very suitable for fast very large scale integration (VLSI) implementation. The VLSI implementation of the algorithm is also given with good performance and low silicon penalty. |
| |
| Keywords: | modular inverse Galois field very large scale integration (VLSI) public key cryptosystem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
