ch26.pdf
math.auckland.ac.nz · 8,845 words · saved by 1 readers
N/A
Chapter 26 Pairings on Elliptic Curves This is a chapter from version 2.0 of the book “Mathematics of Public Key Cryptography” by Steven Galbraith, available from http://www.math.auckland.ac.nz/˜sgal018/crypto- book/crypto-book.html The copyright for this chapter is held by Steven Galbraith. This book was published by Cambridge University Press in early 2012. This is the extended and corrected version. Some of the Theorem/Lemma/Exercise numbers may be different in the published version. Please send an email to S.Galbraith@math.auckland.ac.nz if you find any mistakes. This chapter…
saved by
related reading
- On the Computational Hardness Needed for Quantum Cryptographysimons.berkeley.edu
- The Weil Pairing, and Its Efficient Calculationlink.springer.com
- Elliptic Curve ‘Murmurations’ Found With AI Take Flight | Quanta Magazinequantamagazine.org
- Applied Crypto #1: Elliptic Curve Cryptography | ZK Learning Resourceslearn.0xparc.org
- Elliptic Curve in Bitcoin - Estudio Bitcoinestudiobitcoin.com
- Pairingzeroknowledgeblog.com
- Intro to Bilinear Mapspeople.csail.mit.edu
- What is the math behind elliptic curve cryptography?hackernoon.com
- La cryptographie expliquéebibmath.net
- A (Relatively Easy To Understand) Primer on Elliptic Curve Cryptography | The Cloudflare Blogblog.cloudflare.com
- There is no Diffie-Hellman but Elliptic Curve Diffie-Hellman – Key Materialkeymaterial.net
- Homomorphic encryption - Wikipediaen.wikipedia.org