In this paper, we develop an efficient parallel semi-systolic array structure to concurrently compute multiplication and squaring operations in the binary ...

Sep 9, 2022 · SUMMARY. We introduce a new type of exponentiation algorithm in. GF(2m) using Euclidean inversion. Our approach is based on the fact that.

In this paper, we propose a unified algorithm to concurrently perform multiplication and squaring over GF(2m) using the bipartite modular multiplication ...

A fast method for arithmetic modulo a polynomial over GF(2) is proposed. In this method, any polynomial can be calculated modulo any polynomial over GF(2) ...

This paper presents an efficient parallel-in parallel-out systolic array for AB2 over GF(2m) using the polynomial basis. As compared to existing related ...

In this paper, a generalized Montgomery multiplication algorithm in GF (2m) using the Toeplitz matrix-vector representation is presented.

A new and simple method is described for obtaining several primitive pentanomials over GF (2) from primitive trinomials of the same order.

We have found that a field multiplication over GF(2m) are involved in a number of redundant memory accesses and its inefficiency is originated from this problem ...

Abstract: This paper presents an efficient parallel-in parallel-out systolic array for AB2 over GF(2m) using the polynomial basis. As.

Aug 17, 2017 · Abstract: This letter presents a low-complexity semi-systolic array imple- mentation for polynomial multiplication over GF(2m).