Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
From MaRDI portal
Publication:6074017
DOI10.1007/s10623-023-01223-7zbMath1523.14051OpenAlexW4378651957MaRDI QIDQ6074017
Yu Dai, Chang-An Zhao, Kaizhan Lin, Zijian Zhou
Publication date: 12 October 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01223-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0
- Index calculus in class groups of non-hyperelliptic curves of genus three
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- The Magma algebra system. I: The user language
- Constructive and destructive facets of Weil descent on elliptic curves
- Cover attacks for elliptic curves with cofactor two
- Updating key size estimations for pairings
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- 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
- Point Decomposition Problem in Binary Elliptic Curves
- Faster Hashing to ${\mathbb G}_2$
- Subgroup Security in Pairing-Based Cryptography
- On the Final Exponentiation in Tate Pairing Computations
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Decaf: Eliminating Cofactors Through Point Compression
- The Eta Pairing Revisited
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Elliptic Curve Cryptography
- Selected Areas in Cryptography
- Co-factor clearing and subgroup membership testing on pairing-friendly curves
This page was built for publication: Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
