Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials

摘要: We present a new type of bit-parallel non-recursive Karatsuba multiplier over $GF(2^m)$ generated by an arbitrary irreducible trinomial. This design effectively exploits Mastrovito approach and shifted polynomial basis (SPB) to reduce the time complexity algorithm its space complexity. show that this is only one $T_X$ slower than fastest for all trinomials, where delay 2-input XOR gate. Meanwhile, roughly 3/4 those multipliers. To best our knowledge, it first scheme has reached such bound. result outperforms previously proposed