The authors have already proposed two types of fast algorithms for computing multiplicative inverses in GF(2m), one is sequential and the other is recursive. In this letter, we present a generalised fast algorithm for multiplicative inverses in GF(2m), which makes use of every subfield of GF(2m).