This talk concerns the Tate pairing and its applications in cryptography. I will cover some of the following topics: the mathematics behind the Tate pairing, its generalisation to higher-genus curves, implementation issues, the construction of suitable non-supersingular elliptic curves, the bit-security of keys obtained from pairing-based protocols and the hardness of the bilinear-Diffie-Hellman problem.
Gates 4B (opposite 490), 04/10/03, 4:30 PM