Bit-parallel polynomial basis multiplier for new classes of finite fields

[摘要]：In this paper, three small classes of finite fields GF(2(m)) are found for which low-complexity bit-parallel multipliers are proposed. The proposed multipliers have lower complexities compared to those based on the irreducible pentanomials. It is also shown that there does not always exist an irreducible all-one polynomial, equally spaced polynomial, or trinomial for the new classes of fields.

[全文传递流程]：

一般上传文献全文的时限在1个工作日内