I’d prefer to share notes that grew as a part of a mathematical cryptography seminar I gave in Aragon Affiliation throughout 2022. Because the development of Miller’s algorithm, the cryptography neighborhood began to make use of elliptic curves and their pairing extensively. By now, many publicly accessible code libraries permit one to effectively compute elliptic curves over finite fields and consider their pairings. Nonetheless, in comparison with machine studying, the place the mathematical pre-requisites encompass linear algebra, calculus and fundamental statistics, elliptic curves require extra background and are often taught at a grasp stage in pure arithmetic. This state of affairs poses a problem to engineers and others who want to perceive the mathematical constructing blocks.
To help overcoming the problem talked about above, these notes intention to provide a self-contained, rigorous and elementary account of a lot of the materials required for pairing-based cryptography. I collected materials from a number of customary sources, and typically formulated elementary arguments to switch non-elementary explanations I discovered within the literature. Specifically, I utterly keep away from counting on Galois idea or algebraic geometry not like most textbooks on the topic.
For the time being, the fabric contains:
Naive set idea
Finite abelian teams
Vector areas over finite fields
Finite fields and algebraic closure
Elliptic curves over finite fields
Rational capabilities and divisors over an elliptic curve
Weil pairing
Tate pairing
Please really feel invited to ship me feedback or remarks you may need.
The manuscript might be discovered right here.
