The Weil Pairing, first introduced by Andre Weil in 1940, plays an important role in the theoretical study of the arithmetic of elliptic curves and Abelian varieties. It has also recently become extremely useful in cryptologic constructions related to those objects. In this paper, I'll give the definition of the Weil Pairing, describe efficient algorithms to calculate it, give two applications and describe the motivation to considering it.
Gates 4B (opposite 490)