Since multiplication by 0x5d in GF(2⁸) is invertible, we can compute the modular inverse of 0x5d (with the AES polynomial x⁸ + x⁴ + x³ + x + 1 i.e. 0x11b ). Using the extended Euclidean algorithm we find: