New bit-parallel Montgomery multiplier for trinomials using squaring operation
We construct a bit-parallel Montgomery multiplier over GF(2m) GF ( 2 m ) generated with all the irreducible trinomials using squaring operations. The space complexity of our proposal saves about m2/2 m 2 / 2 logic gates than any other Montgomery or Mastrovito multipliers for trinomials, and matches the Karatsuba multiplier. The time complexity of our proposal is slightly higher than the fastest multipliers, but no more than 2TX 2 T X .
bit-parallel trinomial squaring montgomery multiplication