Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves

Jean-Luc Beuchat; Emmanuel López-Trejo; Luis Martínez-Ramos; Shigeo Mitsunari; Francisco Rodríguez-Henríquez

Paper 2009/276

Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves

Jean-Luc Beuchat, Emmanuel López-Trejo, Luis Martínez-Ramos, Shigeo Mitsunari, and Francisco Rodríguez-Henríquez

Abstract

This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tate pairing over $\mathbb{F}_{3^{509}}$, we report calculation times of just $2.94$ ms and $1.87$ ms on the Intel Core2 and Intel Core i7 architectures, respectively. We also try to answer one important design question that surges: how many cores should be utilized for a given application?

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): jeanluc beuchat @ gmail com
History: 2009-10-26: last of 7 revisions; 2009-06-11: received; See all versions
Short URL: https://ia.cr/2009/276
License: CC BY

BibTeX

@misc{cryptoeprint:2009/276,
      author = {Jean-Luc Beuchat and Emmanuel López-Trejo and Luis Martínez-Ramos and Shigeo Mitsunari and Francisco Rodríguez-Henríquez},
      title = {Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves},
      howpublished = {Cryptology ePrint Archive, Paper 2009/276},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/276}},
      url = {https://eprint.iacr.org/2009/276}
}