Co-factor clearing and subgroup membership testing on pairing-friendly curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Co-factor clearing and subgroup membership testing on pairing-friendly curves


An important cryptographic operation on elliptic curves is hashing to a point on the curve. When the curve is not of prime order, the point is multiplied by the cofactor so that the result has a prime order. This is important to avoid small subgroup attacks for example. A second important operation, in the composite-order case, is testing whether a point belongs to the subgroup of prime order. A pairing is a bilinear map e : G1 × G2 → GT where G1 and G2 are distinct subgroups of prime order r of an elliptic curve, and GT is a multiplicative subgroup of the same prime order r of a finite field extension. Pairing-friendly curves are rarely of prime order. We investigate cofactor clearing and subgroup membership testing on these composite-order curves. First, we generalize a result on faster cofactor clearing for BLS curves to other pairing-friendly families of a polynomial form from the taxonomy of Freeman, Scott and Teske. Second, we investigate subgroup membership testing for G1 and G2. We fix a proof argument for the G2 case that appeared in a preprint by Scott in late 2021 and has recently been implemented in different cryptographic libraries. We then generalize the result to both G1 and G2 and apply it to different pairing-friendly families of curves. This gives a simple and shared framework to prove membership tests for both cryptographic subgroups.
Fichier principal
Vignette du fichier
ElHousniGuillevicPiellard22.pdf (511.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03608264 , version 1 (14-03-2022)
hal-03608264 , version 2 (18-03-2022)
hal-03608264 , version 3 (14-10-2022)



Youssef El Housni, Aurore Guillevic, Thomas Piellard. Co-factor clearing and subgroup membership testing on pairing-friendly curves. AFRICACRYPT 2022 - 13th International Conference on Cryptology, Jul 2022, Fes, Morocco. pp.518--536, ⟨10.1007/978-3-031-17433-9_22⟩. ⟨hal-03608264v3⟩
189 View
87 Download



Gmail Facebook Twitter LinkedIn More