| GF(2233)域上正规基模乘算法的FPGA实现研究 |
| |
| 引用本文： | 王友波,韩月秋. GF(2233)域上正规基模乘算法的FPGA实现研究[J]. 计算机工程与设计, 2005, 26(10): 2614-2615,2724 |
| |
| 作者姓名： | 王友波 韩月秋 |
| |
| 作者单位： | 北京理工大学,计算机科学工程系,北京,100081 |
| |
| 基金项目： | 国家部委基础科研基金项目（14008006）. |
| |
| 摘 要： | 已有的对正规基模乘算法的研究大多针对较小的有限域，不利于将其直接扩展到像GF（2^233）等大有限域中进行FPGA设计实现。为在FPGA上实现正规基下的模乘算法，给出了一种在速度和资源两方面可以折衷的方案以及具体的FPGA实现算法，并实现了硬件描述语言程序设计。在Xilinx的FPGA器件的基础上，完成算法的仿真、综合、布局布线试验。试验表明，实现的模乘算法方案较其它方案更适合于FPGA编程实现。
|
| 关 键 词： | 正规基 模乘 FPGA设计 |
| 文章编号： | 1000-7024（2005）10-2614-02 |
| 收稿时间： | 2004-09-26 |
| 修稿时间： | 2004-09-26 |
FPGA realization of normal basis modular multiplication in GF (2233) |
| |
| WANG You-bo,HAN Yue-qiu. FPGA realization of normal basis modular multiplication in GF (2233)[J]. Computer Engineering and Design, 2005, 26(10): 2614-2615,2724 |
| |
| Authors: | WANG You-bo HAN Yue-qiu |
| |
| Affiliation: | Department of Computer Science and Engineering, Beijing Institute of Technology, Beijing 100081, China |
| |
| Abstract: | The conventional modular multiplication in normal basis is focused on small finite field,which is difficult to apply to large one such as GF(2233).To realize the modular multiplication on FPGA,a modular multiplication algorithm was introduced,that can be a trade-off on speed and areas.A realization method on FPGA was also proposed.The FPGA design was implemented in HDL.The ex-periment,carrying out the simulation and synthesis on Xilinx FPGA device,shows that the algorithm is more suitable for FPGA design. |
| |
| Keywords: | normal basis modular multiplication FPGA design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
