Abstract. In this paper the benefits of implementation of the Tate pairing computation in dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF (3 6m ) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field GF (3 m ). Using this approach an architecture for the hardware implementation of the Tate pairing calculation based on a modified Duursma-Lee algorithm is proposed.
al. proposes a Tate pairing implementation REF based on the modified Duursma-Lee algorithm.
Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
CHES
Computer Science