Issue No. 03 - March (2002 vol. 51)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.990131
<p>A lower bound to the number of AND gates used in parallel multipliers for <tmath>$GF(2/supm/)$</tmath>, under the condition that time complexity be minimum, is determined. In particular, the exact minimum number of AND gates for Primitive Normal Bases and Optimal Normal Bases of Type II multipliers is evaluated. This result indirectly suggests that space complexity is essentially a quadratic function of <tmath>$m$</tmath> when time complexity is kept minimum.</p>
finite fields, parallel multiplier, optimal normal basis
M. Leone and M. Elia, "On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/)," in IEEE Transactions on Computers, vol. 51, no. , pp. 346-351, 2002.