GF(2^(233))域上正规基模乘算法的FPGA实现研究  

FPGA realization of normal basis modular multiplication in GF (2^(233))

作　　者：王友波[1] 韩月秋 

机构地区：[1]北京理工大学计算机科学工程系,北京100081

出　　处：《计算机工程与设计》2005年第10期2614-2615,2724,共3页Computer Engineering and Design

基　　金：国家部委基础科研基金项目(1400B006)

摘　　要：已有的对正规基模乘算法的研究大多针对较小的有限域,不利于将其直接扩展到像GF(2233)等大有限域中进行FPGA设计实现。为在FPGA上实现正规基下的模乘算法,给出了一种在速度和资源两方面可以折衷的方案以及具体的FPGA实现算法,并实现了硬件描述语言程序设计。在Xilinx的FPGA器件的基础上,完成算法的仿真、综合、布局布线试验。试验表明,实现的模乘算法方案较其它方案更适合于FPGA编程实现。The conventional modular multiplication in normal basis is focused on small finite field, which is difficult to apply to large one such as GF （2^233）. To realize the modular multiplication on FPGA, a modular multiplication algorithm was introduced, that can be a trade-offon speed and areas. A realization method on FPGA was also proposed. The FPGA design was implemented in HDL. The experiment, carrying out the simulation and synthesis on Xilinx FPGA device, shows that the algorithm is more suitable for FPGA design.

关 键 词：正规基 模乘 FPGA设计 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]