Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
DOI10.1016/j.ffa.2023.102263zbMath1525.14031OpenAlexW4384575590MaRDI QIDQ6136710
Chang-An Zhao, Yu Dai, Fangguo Zhang
Publication date: 31 August 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2023.102263
pairing based cryptographyBW13-P310 and BW19-P286hashing to \(\mathbb{G}_2\)pairing-friendly curves with the lack of twists
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
- Unnamed Item
- Nonsingular plane cubic curves over finite fields
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- 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
- Guide to Pairing-Based Cryptography
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Faster Hashing to ${\mathbb G}_2$
- Indifferentiable Hashing to Barreto–Naehrig Curves
- How to Hash into Elliptic Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- The Eta Pairing Revisited
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- The Arithmetic of Elliptic Curves
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Elliptic Curve Cryptography
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- On the Size of Pairing-Based Non-interactive Arguments
- Algorithmic Number Theory
- Co-factor clearing and subgroup membership testing on pairing-friendly curves
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
This page was built for publication: Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
