[Resource Topic] 2012/414: Low complexity bit-parallel $GF(2^m)$ multiplier for all-one polynomials

Welcome to the resource topic for 2012/414

Low complexity bit-parallel GF(2^m) multiplier for all-one polynomials

Authors: Yin Li, Gong-liang Chen, Xiao-ning Xie


This paper presents a new bit-parallel multiplier for the finite field GF(2^m) generated with an irreducible all-one polynomial. Redundant representation is used to reduce the time delay of the proposed multiplier, while a three-term Karatsuba-like formula is combined with this representation to decrease the space complexity. As a result, the proposed multiplier requires about 10 percent fewer AND/XOR gates than the most efficient bit-parallel multipliers using an all-one polynomial, while it has almost the same time delay as the previously proposed ones.

ePrint: https://eprint.iacr.org/2012/414

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .