Abstract
The Weil Pairing, first introduced by André 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. This paper gives the definition of the Weil Pairing, describes efficient algorithms to calculate it, gives two applications, and describes the motivation to considering it.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Miller, V. The Weil Pairing, and Its Efficient Calculation. J Cryptology 17, 235–261 (2004). https://doi.org/10.1007/s00145-004-0315-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-004-0315-8
- Elliptic curve
- Discrete logarithm
- Weil pairing