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

DOI10.1007/978-3-031-17433-9_22zbMath1515.94066OpenAlexW4223514846MaRDI QIDQ6103102

Thomas Piellard, Youssef El Housni, Aurore Guillevic

Publication date: 2 June 2023

Published in: Progress in Cryptology - AFRICACRYPT 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-17433-9_22

zbMATH Keywords

hashingcofactor clearingsubgroup membership testing

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Elliptic curves over local fields (11G07)

Related Items (2)

Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists

Cites Work

• Unnamed Item
• Nonsingular plane cubic curves over finite fields
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• LOVE a pairing
• Families of SNARK-friendly 2-chains of elliptic curves
• A taxonomy of pairing-friendly elliptic curves
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Pairing-Friendly Elliptic Curves of Prime Order

This page was built for publication: Co-factor clearing and subgroup membership testing on pairing-friendly curves