Pairings on Elliptic Curves – Parameter Selection and Efficient Computation


October 19, 2010


Michael Naehrig


Cryptography Group at MSR Redmond.


This talk is about efficient pairing computation on elliptic curves. I will discuss particularly implementation-friendly curves, the use of the polynomial parameter representation to compute pairings on BN curves, and reasons to use affine coordinates for pairings at high security levels.

This contains joint work with P. Barreto, G. Pereira, M. Simplício Jr, P. Schwabe, R. Niederhagen, K. Lauter, and P. Montgomery.


Michael Naehrig

Michael Naehrig is a Post Doc Researcher in the Cryptography Group at MSR Redmond. He conducted his undergraduate studies in Mathematics at RWTH Aachen University, Germany, and received his Ph.D. from Eindhoven University of Technology, The Netherlands, under the supervision of Tanja Lange. His main research interests are the construction of pairing-friendly elliptic curves, pairing algorithms and the efficient implementation of cryptographic pairings.