%0 Journal Article
%T Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation<br>Low-Complexity Bit-Parallel Multiplier over GF(2$^m$) Using Dual Basis Representation
%A Chiou-Yng Lee
%A Jenn-Shyong Horng
%A I-Chang Jou
%A <br>Chiou-Yng Lee
%A Jenn-Shyong Horng
%A and I-Chang Jou
%J 计算机科学技术学报
%D 2006
%I 
%X Recently, cryptographic applications based on finite fields have attracted much attention. The most demanding finite field arithmetic operation is multiplication. This investigation proposes a new multiplication algorithm over GF(2m) using the dual basis representation. Based on the proposed algorithm, a parallel-in parallel-out systolic multiplier is presented. The architecture is optimized in order to minimize the silicon covered area (transistor count). The experimental results reveal that the proposed bit-parallel multiplier saves about 65% space complexity and 33% time complexity as compared to the traditional multipliers for a general polynomial and dual basis of GF(2m).
%K bit-parallel systolic multiplier
%K inner product
%K dual basis
%K Galois field GF(2m)<br>内积
%K 双重基础
%K Galois场GF（2^m）
%K 低复杂性
%K 计算机技术
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=646CC5F0959C6218DB4CD69A7D59E5DA&yid=37904DC365DD7266&vid=659D3B06EBF534A7&iid=B31275AF3241DB2D&sid=3E851F4852A9516C&eid=CC5564FFEBD22614&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=24