ArticleslgStudy

computer science

Weil pairing

Weil pairing is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Weil pairing rather than just read about it. In short: In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing n of an elliptic curve E, taking values in nth roots of unity. More generally there is a similar Weil pairing between points of order n of an abelian variety and its dual.

Key takeaways

  • Weil pairing belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Weil pairing to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Weil pairing from memory before moving on to harder problems.

Reference excerpt

In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing n of an elliptic curve E, taking values in nth roots of unity. More generally there is a similar Weil pairing between points of order n of an abelian variety and its dual. It was introduced by André Weil (1940) for Jacobians of curves, who gave an abstract algebraic definition; the corresponding results for elliptic functions were known, and can be expressed simply by use of the Weierstrass sigma function.

Formulation Choose an elliptic curve E defined over a field K, and an integer n > 0 (we require n to be coprime to char(K) if char(K) > 0) such that K contains a primitive nth root of unity. Then the n-torsion on E ( K ¯ ) {\displaystyle E({\overline {K}})} is known to be a Cartesian product of two cyclic groups of order n. The Weil pairing produces an n-th root of unity

w ( P , Q ) ∈ μ n {\displaystyle w(P,Q)\in \mu _{n}}

by means of Kummer theory, for any two points P , Q ∈ E ( K ) [ n ] {\displaystyle P,Q\in E(K)[n]} , where E ( K ) [ n ] = { T ∈ E ( K ) ∣ n ⋅ T = O } {\displaystyle E(K)[n]=\{T\in E(K)\mid n\cdot T=O\}} and μ n = { x ∈ K ∣ x n = 1 } {\displaystyle \mu _{n}=\{x\in K\mid x^{n}=1\}} . A down-to-earth construction of the Weil pairing is as follows. Choose a function F in the function field of E over the algebraic closure of K with divisor

d i v ( F ) = ∑ 0 ≤ k < n [ P + k ⋅ Q ] − ∑ 0 ≤ k < n [ k ⋅ Q ] . {\displaystyle \mathrm {div} (F)=\sum _{0\leq k<n}[P+k\cdot Q]-\sum _{0\leq k<n}[k\cdot Q].}

So F has a simple zero at each point P + kQ, and a simple pole at each point kQ if these points are all distinct. Then F is well-defined up to multiplication by a constant. If G is the translation of F by Q, then by construction G has the same divisor, so the function G/F is constant. Therefore if we define

w ( P , Q ) := G F {\displaystyle w(P,Q):={\frac {G}{F}}}

we shall have an n-th root of unity (as translating n times must give 1) other than 1. With this definition it can be shown that w is alternating and bilinear, giving rise to a non-degenerate pairing on the n-torsion. The Weil pairing does not extend to a pairing on all the torsion points (the direct limit of n-torsion points) because the pairings for different n are not the same. However they do fit together to give a pairing Tℓ(E) × Tℓ(E) → Tℓ(μ) on the Tate module Tℓ(E) of the elliptic curve E (the inverse limit of the ℓn-torsion points) to the Tate module Tℓ(μ) of the multiplicative group (the inverse limit of ℓn roots of unity).

Generalisation to abelian varieties For abelian varieties over an algebraically closed field K, the Weil pairing is a nondegenerate pairing

A [ n ] × A ∨ [ n ] ⟶ μ n {\displaystyle A[n]\times A^{\vee }[n]\longrightarrow \mu _{n}}

for all n prime to the characteristic of K. Here A ∨ {\displaystyle A^{\vee }} denotes the dual abelian variety of A. This is the so-called Weil pairing for higher dimensions. If A is equipped with a polarisation

λ : A ⟶ A ∨ {\displaystyle \lambda :A\longrightarrow A^{\vee }} , then composition gives a (possibly degenerate) pairing

A [ n ] × A [ n ] ⟶ μ n . {\displaystyle A[n]\times A[n]\longrightarrow \mu _{n}.}

If C is a projective, nonsingular curve of genus ≥ 0 over k, and J its Jacobian, then the theta-divisor of J induces a principal polarisation of J, which in this particular case happens to be an isomorphism (see autoduality of Jacobians). Hence, composing the Weil pairing for J with the polarisation gives a nondegenerate pairing

J [ n ] × J [ n ] ⟶ μ n {\displaystyle J[n]\times J[n]\longrightarrow \mu _{n}}

for all n prime to the characteristic of k. As in the case of elliptic curves, explicit formulae for this pairing can be given in terms of divisors of C.

Applications The pairing is used in number theory and algebraic geometry, and has also been applied in elliptic curve cryptography and identity based encryption.

See also Tate pairing Pairing-based cryptography Boneh–Franklin scheme Homomorphic Signatures for Network Coding

References

Weil, André (1940), "Sur les fonctions algébriques à corps de constantes fini", Les Comptes rendus de l'Académie des sciences, 210: 592–594, MR 0002863

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Weil pairing

Start with the simplest possible case. Write down what Weil pairing claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Weil pairing before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Weil pairing ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Weil pairing

In research
Weil pairing appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Weil pairing in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Weil pairing is common in secondary-school and first-year university syllabi. It links to neighbouring topics Abelian varieties, Elliptic curves, Pairing-based cryptography, so understanding it makes those chapters shorter.
In everyday life
Look for Weil pairing outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Weil pairing in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Weil pairing means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Weil pairing out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Weil pairing in simple terms?

In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing n of an elliptic curve E, taking values in nth roots of unity. More generally there is a similar Weil pairing between points of order n of an abelian variety and its du…

Why does Weil pairing matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Weil pairing?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Weil pairing.

Tags

  • Abelian varieties
  • Elliptic curves
  • Pairing-based cryptography

Keep exploring