On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
Michele Elia, M. Leone · IEEE Transactions on Computers · 2002
A lower bound to the number of AND gates used in parallel multipliers for GF(2/sup m/), 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 m when time complexity is kept minimum.