一种GF(2~k)域的高效乘法器及其VLSI实现

在分析全串行和全并行 GF(2 k)域乘法的基本原理基础上提出了一种适合于任意 GF(2 k)域的乘法器 UHGM(U nified Hybrid Galois Field Multiplier) .它为当前特别重要的 k为素数的 GF(2 k)域乘法 ,提供了一种高效的实现方法 .该乘法器具有结构规整、模块化好的特点 ,特别适合于 VL SI实现 ,同时这种结构具有粗粒度的面积和速度的可伸缩性 ,方便了在大范围内进行实现面积和速度的权衡 .最后给出了 GF(2 1 6 3)域上乘法器的 ASIC综合的结果

An Efficient Multiplier for GF(2k) and the VLSI Implementation

Public-K ey Cryptography as the base of modern identification,authentication,secure commu nications technology,depends on Galois Field multiplication that is based on dis crete logarithm problem.By analyzing the bit serial multiplier and bit parellel multiplier,a Unified Hybrid Galois field Multiplier,namely UHGM,is introd uced.An Efficient implementation is carried out for the multiplication on GF(2 k ),especially when k is a prime number.UHGM is suitable for the VLSI im plemenation due to its regularity and modularity,whose structure can t rade off the area against the performance conveniently.Finally a sample GF(2 163 ) multiplier is presented,as well as the result of verifica tion and sysnthesis on FPGA and ASIC.