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
- Discovering cryptographic weaknesses with Claude \ Anthropicanthropic.com
- La cryptographie expliquéebibmath.net
- On the Computational Hardness Needed for Quantum Cryptographysimons.berkeley.edu
- Applied Crypto #1: Elliptic Curve Cryptography | ZK Learning Resourceslearn.0xparc.org
- Intro to Bilinear Mapspeople.csail.mit.edu
- VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
- Wei Dai's Home Pageweidai.com
- Ring learning with errors - Wikipediaen.wikipedia.org
- Elliptic Curve in Bitcoin - Estudio Bitcoinestudiobitcoin.com
- Pearl Whitepaperpearlresearch.ai