FPGA realization of normal basis modular multiplication in GF (2~(233))
Han Yue-qiu · Jisuanji gongcheng yu sheji · 2005
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.