New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{n})$</tex> </formula>

New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over - | IEEE Journals & Magazine | IEEE Xplore