Efficient Implementation of the η T Pairing on GPU

Recently, efficient implementation of cryptographic algorithms on graphics processing units (GPUs) has attracted a lot of attention in the cryptologic research community. In this paper, we deal with efficient implementation of the ηT pairing on supersingular curves over finite fields of characteristics 3. We report the performance results of implementations on NVIDIA GTX 285, GTX 480, Tesla C1060, and Tesla C2050 graphics cards. We have implemented ηT pairing in three different ways, namely, one pairing by one thread (Implementation I), one pairing by multiple threads (Implementation II), and multiple pairings by multiple threads in a bitsliced fashion (Implementation III). The timing for Implementation III on a single GTX 285 is 1.47, 8.15, and 140.7 milliseconds for ηT pairing over F397 , F3193 , and F3509 , respectively. On a single GTX 480, the throughput performance of Implementation III is 33710, 4970, and 332 ηT pairings per second over F397 , F3193 , and F3509 , respectively. To the best of our knowledge, this is the first implementation of ηT pairing on GPU. Furthermore, it is currently the software implementation that achieves the highest single-chip throughput for ηT pairing.

[1]  Tsuyoshi Takagi,et al.  Faster Implementation of eta-T Pairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition , 2008, Pairing.

[2]  Nicolas Estibals,et al.  Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves , 2010, Pairing.

[3]  Masaaki Shirase,et al.  Some Efficient Algorithms for the Final Exponentiation of eta T Pairing , 2007, ISPEC.

[4]  Tanja Lange,et al.  Breaking ECC2K-130 , 2009, IACR Cryptol. ePrint Arch..

[5]  Julio César López-Hernández,et al.  High-Speed Parallel Software Implementation of the ηT Pairing , 2010, CT-RSA.

[6]  Johann Großschädl,et al.  On Software Parallel Implementation of Cryptographic Pairings , 2008, IACR Cryptol. ePrint Arch..

[7]  Tim Güneysu,et al.  Exploiting the Power of GPUs for Asymmetric Cryptography , 2008, CHES.

[8]  John Waldron,et al.  Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware , 2009, AFRICACRYPT.

[9]  John Waldron,et al.  Practical Symmetric Key Cryptography on Modern Graphics Hardware , 2008, USENIX Security Symposium.

[10]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[11]  Tsuyoshi Takagi,et al.  Reduction Optimal Trinomials for Efficient Software Implementation of the etaT Pairing , 2007, IWSEC.

[12]  Tanja Lange,et al.  ECM on Graphics Cards , 2009, IACR Cryptol. ePrint Arch..

[13]  Francisco Rodríguez-Henríquez,et al.  Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves , 2009, CANS.

[14]  Adi Shamir,et al.  Fast Exhaustive Search for Polynomial Systems in F2 , 2010, IACR Cryptol. ePrint Arch..

[15]  Masaaki Shirase,et al.  Universal etaT Pairing Algorithm over Arbitrary Extension Degree , 2007, WISA.

[16]  Chen,et al.  The billion-mulmod-per-second PC , 2009 .