A VLSI architecture for fast inversion in GF(2/sup m/)
G.L. Feng · IEEE Transactions on Computers · 1989
A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.>