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
Conference paper

DOI: 10.1007/978-3-642-10433-6_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5888)
Cite this paper as:
Beuchat JL., López-Trejo E., Martínez-Ramos L., Mitsunari S., Rodríguez-Henríquez F. (2009) Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves. In: Garay J.A., Miyaji A., Otsuka A. (eds) Cryptology and Network Security. CANS 2009. Lecture Notes in Computer Science, vol 5888. Springer, Berlin, Heidelberg

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 arises: how many cores should be utilized for a given application?

Keywords

Tate pairing ηT pairing supersingular curve finite field arithmetic multi-core 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jean-Luc Beuchat
    • 1
  • Emmanuel López-Trejo
    • 2
  • Luis Martínez-Ramos
    • 3
  • Shigeo Mitsunari
    • 4
  • Francisco Rodríguez-Henríquez
    • 3
  1. 1.Graduate School of Systems and Information EngineeringUniversity of TsukubaIbarakiJapan
  2. 2.Nehalem Platform Validation, Intel Guadalajara Design CenterTlaquepaqueMéxico
  3. 3.Computer Science DepartmentCentro de Investigación y de Estudios Avanzados del IPNMéxico CityMéxico
  4. 4.Cybozu Labs, Inc.Akasaka Twin Tower East 15F, 2-17-22 Akasaka, Minato-kuTokyo

Personalised recommendations