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

DOI10.1007/978-3-031-17433-9_22zbMATH Open1515.94066OpenAlexW4223514846MaRDI QIDQ6103102FDOQ6103102

Authors: Youssef El Housni, Aurore Guillevic, Thomas Piellard 

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

Recommendations

• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
• Pairing-Friendly Elliptic Curves of Prime Order
• Fast Hashing to G 2 on Pairing-Friendly Curves
• Subgroup security in pairing-based cryptography
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves

zbMATH Keywords

hashingcofactor clearingsubgroup membership testing

Mathematics Subject Classification ID

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

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Pairing-Friendly Elliptic Curves of Prime Order
• Nonsingular plane cubic curves over finite fields
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Title not available (Why is that?)
• LOVE a pairing
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• Curves with Fast Computations in the First Pairing Group
• Families of SNARK-friendly 2-chains of elliptic curves

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103102)