Cryptology ePrint Archive: Report 2009/276

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

Jean-Luc Beuchat and Emmanuel López-Trejo and Luis Martínez-Ramos and 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?

Category / Keywords: implementation /

Date: received 9 Jun 2009, last revised 25 Oct 2009

Contact author: jeanluc beuchat at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20091026:004024 (All versions of this report)

Short URL: ia.cr/2009/276