In this paper, we present a new cube root algorithm in the finite field F _ q F q with q qa
power of prime, which extends the Cipolla–Lehmer type algorithms (Cipolla, Un metodo per …

This study presented an algorithm for fast hardware execution of complex cube root. In this
algorithm, which is based on the Laurent series of∛ z function, first, the z-plane's numbers …

In this paper, the Hermite polynomial representation is adapted as a new way to represent
certain finite fields of characteristic three. We give the multiplication method to multiply two …

To support emerging pairing-based protocols related to cloud computing, an efficient
algorithm/hardware codesign methodology of ηT pairing over characteristic three is …

In this paper, we propose two new algorithms and their hardware implementations for the
normal basis multiplication over GF (pm), where p∈{2, 3}. In this case, the proposed …

In several important applications, we often encounter with the computation of a Toeplitz
matrix vector product (TMVP). In this work, we propose a k-way splitting method for a TMVP …

In this paper, we propose a parallel multiplier over arbitrary finite field GF (pm). In particular,
we apply the proposed multiplier to GF (3m) defined by irreducible trinomial which has …

We propose a parallel pth powering method over an arbitrary finite field GF (pm). Using the
proposed method, we present the explicit formulae for the computation of cubing over a …

To support emerging pairing-based protocols related to cloud computing, an efficient
algorithm/hardware code sign methodology of ηT pairing over characteristic three is …

Families of irreducible polynomials over 𝔽p, p odd are provided, where pth roots can be
efficiently computed. Efficient cube root computations in extensions of characteristic 3 have …