FPGA上二元域公钥系统中求逆模块的改进  

Improvement of Inverses in GF（2^m） for Public-key Cryptography System on FPGA

作　　者：宋灏龙[1] 梁华国[1] 单国华[1] 

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《小型微型计算机系统》2010年第2期259-263,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金重点项目(60633060)资助;国家自然科学基金项目(60876028)资助;国家"八六三"高技术研究发展计划项目(2007AA01Z113-1;2007AA01Z113)资助;中国科学院计算技术研究所系统结构重点实验室开放课题基金项目(ICT-ARCH200704)资助

摘　　要：公钥密码体制建立在有限域上本文针对二元域上操作复杂的基本运算求逆,将软件应用中效率较高的殆逆算法移植到FPGA中,利用其分步特点达到较低延迟,并利用度数和乘法的规律性缩减执行周期,以较小硬件开销增量换取了较大的性能提高.且模块又可能对多个二元域通用.此外,方案同样适用于软件求逆.Public-key cryptography is built on Galois field. Focusing on complicated inverse operation in GF（2^m）,almost inverse algorithm which works efficiently in software applications is transplanted to FPGA in this paper,using its two steps feature to achieve higher frequency. And the lows of degree and multiplication were found to reduce clock cycles. Greater performance increase is achieved by smaller hardware cost. Additionally,the module can be fit for several binary finite fields. Further,the improvement can be applied to software and other public-key cryptography systems in GF（2^m）.

关 键 词：二元域 公钥密码体制 求逆 FPGA 

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