The Weil Pairing, and Its Efficient Calculation | SpringerLink
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.
Victor S. Miller1 11k Accesses 407 Citations 15 Altmetric Explore all metrics 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. Similar content being viewed by others Author information…
saved by
related reading
- ch26.pdfmath.auckland.ac.nz
- Elliptic Curve ‘Murmurations’ Found With AI Take Flight | Quanta Magazinequantamagazine.org
- Diffie–Hellman key exchange - Wikipediaen.wikipedia.org
- Secure multi-party computation - Wikipediaen.wikipedia.org
- VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
- ants.dvicrypto.stanford.edu
- Elliptic Curve in Bitcoin - Estudio Bitcoinestudiobitcoin.com
- Math & Engineeringxn--2-umb.com
- Elliptic curveszeroknowledgeblog.com
- Pairingzeroknowledgeblog.com
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- Intro to Bilinear Mapspeople.csail.mit.edu