Fast bit-parallel GF(2/sup n/) multiplier for all trinomials

Based on a new representation of GF(2/sup n/), we present two multipliers for all irreducible trinomials. Space complexities of the multipliers match the best results. The time complexity of one multiplier is T/sub A/ + (1 + [log/sub 2/ n])T/sub X/ for all irreducible trinomials, where T/sub A/ and T/sub X/ are the delay of one 2-input AND and XOR gates, respectively.