Efficient hardware for the Tate pairing calculation in characteristic three

TitleEfficient hardware for the Tate pairing calculation in characteristic three
Publication TypeConference Paper
Year of Publication2005
AuthorsKerins, T., W. MARNANE, E. POPOVICI, and P. S. L. M. BARRETO
Conference Name7th International Workshop - Cryptographic Hardware and Embedded Systems -- CHES'2005
Date PublishedSeptember, 2005
PublisherLecture Notes in Computer Science - Springer Berlin / Heidelberg
Conference LocationEdinburgh, UK
ISBN Number0302-9743 (Print) 1611-3349 (Online)
Abstract

In this paper the benefits of implementation of the Tate pairing computation on dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF(36m) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field GF(3m). Using this approach, an architecture for the hardware implementation of the Tate pairing calculation based on a modified Duursma-Lee algorithm is proposed.

URLhttp://www.springerlink.com/content/3841kkkpkmmxlnnd/?p=31d080e6b9d1470ca8916c2bc5ce71bd&pi=29
DOI10.1007/11545262_30