elliptic curve pairing
Summary
Secure elliptic curves need a large prime-order subgroup and a large embedding degree. Pairings can move ECDLP into a finite field, so they are either an attack surface or a deliberate protocol feature.
Concept
For
Consequently
A nondegenerate bilinear pairing has the form
with
If
reducing ECDLP to DLOG in
Curve selection therefore checks:
- A large prime group order or prime-order subgroup.
- No small embedding degree.
- Group order not equal to
. - Safe formulas, input validation, and twist security.
Application
- NIST P-256 uses a sparse prime and
for efficient arithmetic. - Curve25519 uses
, Montgomery-form x-only arithmetic, cofactor , and a secure twist; scalar clamping keeps operations in the intended subgroup. - secp256k1 uses
and is deployed by Bitcoin.
Invalid-point attacks exploit implementations that scalar-multiply a point on another curve. Validate points or use a design, such as Curve25519’s x-only ladder, that safely handles the twist. See pairing based cryptography for constructive uses.