Pairing friendly elliptic curves and fields

Igor Shparlinski (Macquarie University)

MSI Computational Mathematics Seminar Series

DATE: 2008-09-10
TIME: 11:00:00 - 12:00:00
LOCATION: John Dedman G35
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
We present some theoretic and heuristic estimates for the number of elliptic curves with low embedding which is essential for their applicability in pairing based cryptography. We also give estimates for the number of fields over which such curves may exist. The main ideas behind the proofs will be explained as well. Finally, we give a heuristic analysis of the so-called MNT algorithm and show that it produces a rather "thin" sequence of curves.
BIO:
http://www.ics.mq.edu.au/~igor/