Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over F_{2^{1223}}

Adikari Jithra (1) , Anwar Hasan (1) , Christophe Negre (2)

1 ECE - Department of Electrical and Computer Engineering [Waterloo]
2 DALI - Digits, Architectures et Logiciels Informatiques

At the CHES workshop last year, Ghosh et al. presented an FPGA based cryptoprocessor, which for the first time ever makes it possible to compute an eta pairing at the 128-bit security level in less than one milli-second. The high performance of their cryptoprocessor comes largely from the use of the Karatsuba method for field multiplication. In this article, for the same type of pairing we propose hybrid sequential/parallel multipliers based on the Toeplitz matrix-vector products and present some optimizations for the final exponentiation, resulting in high performance cryptoprocessors. On the same kind of FPGA devices, our cryptoprocessor performs pairing faster than that of \cite{ghosh} while requiring less hardware resources. We also present ASIC implementations and report that the three-way split multiplier based cryptoprocessor consumes less energy than the two-way.

Mots clés: pairing cryptography; FPGA; ASIC; high speed implementation

Domaines: Cryptographie et sécurité [cs.CR]

Adikari Jithra, Anwar Hasan, Christophe Negre. Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over F_{2^{1223}}. Selected Areas in Cryptography, Aug 2012, Windsor, Canada. pp.166-183, ⟨10.1007/978-3-642-35999-6_12⟩. ⟨hal-00813681⟩