Low-delay AES polynomial basis multiplier
In this Letter, an efficient implementation of the bit-parallel polynomial basis (PB) multiplier over the binary field GF(28) generated by the type I irreducible pentanomial f(y) = y 8 + y 4 + y 3 + y + 1 is presented. This pentanomial is especially important because it is used in the advanced encryption standard (AES). Therefore, any optimisation of the multiplier complexity over this finite field is very relevant because efficient AES implementation can be obtained. The bit-parallel multiplier here presented has the lowest delay known to date for similar multipliers based on this irreducible pentanomial.
