Definition
An elliptic curve pairing is a bilinear map that takes two points from elliptic-curve groups and outputs an element in a third, multiplicative target group. Written as e(P, Q), it satisfies bilinearity, meaning e(aP, bQ) equals e(P, Q) raised to the power ab, and non-degeneracy, meaning the map does not collapse everything to the identity. This single algebraic property unlocks cryptographic operations that plain scalar multiplication cannot perform.
Why bilinearity matters
Because exponents can be moved across the pairing, a verifier can check relationships between secret scalars without ever learning them. That is exactly what lets one pairing equation confirm an aggregated BLS signature, or verify a polynomial evaluation against a commitment, in constant time regardless of how much data is involved.
The pairings used in practice
The two classical constructions are the Weil pairing and the Tate pairing; production systems use optimized variants of the Tate pairing for speed. They require pairing-friendly curves such as BLS12-381 or BN254, which are engineered so the pairing is efficient to compute yet hard to invert. The tradeoff is that pairing arithmetic is considerably more expensive than ordinary curve operations, and these curves carry larger fields than typical signature curves.
Pairings are the foundation beneath BLS signatures and the KZG polynomial commitment, both of which would be impossible without a bilinear map.
In Simple Terms
An elliptic curve pairing is a bilinear map that takes two points from elliptic-curve groups and outputs an element in a third, multiplicative target group.…