Skip to Main content Skip to Navigation
Conference papers

A comparison between hardware accelerators for the modified Tate pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Abstract : In this article we propose a study of the modified Tate pairing in characteristics two and three. Starting from the $\eta_T$ pairing introduced by Barreto {\em et al.}, we detail various algorithmic improvements in the case of characteristic two. As far as characteristic three is concerned, we refer to the survey by Beuchat {\em et al.}. We then show how to get back to the modified Tate pairing at almost no extra cost. Finally, we explore the trade-offs involved in the hardware implementation of this pairing for both characteristics two and three. From our experiments, characteristic three appears to have a slight advantage over characteristic two.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/inria-00423977
Contributor : Jérémie Detrey <>
Submitted on : Tuesday, October 13, 2009 - 3:35:36 PM
Last modification on : Tuesday, June 16, 2020 - 12:56:02 PM
Document(s) archivé(s) le : Tuesday, October 16, 2012 - 12:11:05 PM

File

pairing2008_rr.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez. A comparison between hardware accelerators for the modified Tate pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$. Second International Conference on Pairing-Based Cryptography – Pairing 2008, Sep 2008, Egham, United Kingdom. pp.297-315, ⟨10.1007/978-3-540-85538-5_20⟩. ⟨inria-00423977⟩

Share

Metrics

Record views

363

Files downloads

325