Cryptology ePrint Archive: Report 2005/065

Efficient hardware for the Tate pairing calculation in characteristic three

T. Kerins and W. P. Marnane and E. M. Popovici and P. S. L. M. Barreto

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.

Category / Keywords: implementation / hardware

Date: received 28 Feb 2005

Contact author: timk at rennes ucc ie

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050301:142755 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]