Pairings on Elliptic Curves - Parameter Selection and Efficient Computation

Speaker  Michael Naehrig

Host  Kristin Lauter

Affiliation  Cryptography Group at MSR Redmond.

Duration  00:56:00

Date recorded  19 October 2010

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.

©2010 Microsoft Corporation. All rights reserved.
> Pairings on Elliptic Curves - Parameter Selection and Efficient Computation