|
|||||
|
|
Low complexity bit-parallel normal bases multipliers for GF(2/sup n/) |
|
| Authors: | Fan H. Dai Y. |
| Affiliation: | Dept. of Comput. Sci., Tsinghua Univ., Beijing, China; |
| Abstract: | 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. |
| Keywords: | |