cronokirby

(2026-01) The Cokernel Pairing

2026-01-01

Abstract

We study a new pairing, beyond the Weil and Tate pairing. The Weil pairing is a non-degenerate pairing E[m]×E[m]μmE[m] \times E[m] \to \mu_{m}, which operates on the kernel of [m][m]. Similarly, when μmFq\mu_{m} \subseteq \mathbb{F}_q^*, the Tate pairing is a non-degenerate pairing E[m](Fq)×E(Fq)/[m]E(Fq)μmE[m](\mathbb{F}_q) \times E(\mathbb{F}_q) / [m]E(\mathbb{F}_q) \to \mu_{m}, which connects the kernel and the rational cokernel of [m][m]. We define a pairing [ \langle{\quad}\rangle_m : E(\mathbb{F}_q) / [m]E(\mathbb{F}_q) \times E(\mathbb{F}_q) / [m]E(\mathbb{F}q) \to \mu{m}] on the rational cokernels of [m][m], filling the gap left by the Weil and Tate pairing. When E[m]E(Fq)E[m] \subseteq E(\mathbb{F}_q), this pairing is non-degenerate, and can be computed using three Tate pairings, and two discrete logarithms in μm\mu_{m}, assuming a basis for E[m]E[m]. For m=m = \ell prime, this pairing allows us to study E(Fq)/[]E(Fq)E(\mathbb{F}_q) / [\ell]E(\mathbb{F}_q) directly and to simplify the computation for a basis of E[k]E[\ell^k], and more generally the Sylow \ell-torsion. This finds natural applications in isogeny-based cryptography when computing k\ell^k-isogenies.