Title of article :
Low complexity bit-parallel normal bases multipliers for GF(2/sup n/)
Y.، Dai, نويسنده , , H.، Fan, نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Based on the divide-and-conquer technique, three bit-parallel normal bases multipliers are presented for GF(2/sup n/). The space complexity of one multiplier is about 3/4 of the smallest known normal bases multiplier, although it needs at most one more XOR gate delay.
Journal title :
IEE Electronics Letters