时 间: 2011年7月13日（周三）上午9:30

地 点: 清华大学高等研究院 科学馆322报告厅

题 目: On the Computation of Weil Pairing and Tate Pairing

报 告 人: Guangwu Xu

University of Wisconsin-Milwaukee

报告摘要: Over the past decade, we have seen several remarkable applications of Weil/Tate pairings in cryptography. For example, they are used for the reduction of discrete logarithm problem for certain class of elliptic curves. They are also basic building blocks for some exciting new cryptographic primitives. In this talk, we shall start by formulating computational procedure that relates a special class of divisors and rational functions. Then we shall discuss the Weil/Tate pairings on elliptic curves, and the Miller's algorithm for computing pairings. In the last part, we shall discuss our refinements of Miller's algorithm and some implementation issues.

This talk is based on joint work with I. F. Blake and V. K. Murty, and with B. Li