The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

We present a new low-complexity bit-parallel canonical basis multiplier for the field GF (2m)
generated by an all-one-polynomial. The proposed canonical basis multiplier requires …

Bit-parallel finite field multiplication using polynomial basis can be realized in two steps:
polynomial multiplication and reduction modulo the irreducible polynomial. In this article, we …

Based on Toeplitz matrix-vector products and coordinate transformation techniques, we
present a new scheme for subquadratic space complexity parallel multiplication in GF (2 n) …

The Massey-Omura multiplier of GF (2/sup m/) uses a normal basis and its bit parallel
version is usually implemented using m identical combinational logic blocks whose inputs …

This paper presents a new parallel multiplier for the Galois field GF (2/sup m/) whose
elements are represented using the optimal normal basis of type II. The proposed multiplier …

As the use of wireless devices becomes widespread, so does the need for strong and
secure transport protocols. Even with this intensified need for securing systems, using …

This article presents simple and highly regular architectures for finite field multipliers using a
redundant representation. The basic idea is to embed a finite field into a cyclotomic ring …

This paper presents the design and implementation of a crypto processor, a special-purpose
microprocessor optimized for the execution of cryptography algorithms. This crypto …

The state-of-the-art Galois field GF (2/sup m/) multipliers offer advantageous space and time
complexities when the field is generated by so special irreducible polynomial. To date, the …