Improved algorithm for division over GF(2m)

An improved algorithm for division over GF(2^m) is proposed. It is based on a look-ahead procedure that allows division over GF(2^m) to be performed in any number of clock cycles up to 2^m-1. The hardware complexity of the divider depends on the level of look-ahead chosen and hence the speed of operation required. An example using this divider in solving the key equation for single-error correcting Reed-Solomon codes is also considered.