Some remarks on efficient inversion in finite fields
Christof Paar · 2002
This article is concerned with bit parallel inverters over finite fields. Two alternative approaches for inversion with low complexity are reviewed. Both methods are based on multiple field extension of GF(2). It is shown that one architecture is a generalization of the other's architecture core algorithm. As an example, the complexity of an inverter in the field GF(2/sup 8/) is computed.