Fast hashing to G₂ on pairing-friendly curves with the lack of twists

DOI10.1016/J.FFA.2023.102263zbMATH Open1525.14031OpenAlexW4384575590MaRDI QIDQ6136710FDOQ6136710

Authors: Yu Dai, Fangguo Zhang, Chang-An Zhao 

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

Recommendations

• Fast Hashing to G 2 on Pairing-Friendly Curves
• Faster hashing to \({\mathbb G}_2\)
• Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• Faster pairing computations on curves with high-degree twists

zbMATH Keywords

pairing based cryptographyBW13-P310 and BW19-P286hashing to \(\mathbb{G}_2\)pairing-friendly curves with the lack of twists

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational aspects of algebraic curves (14Q05)

Cites Work

• The Magma algebra system. I: The user language
• Factoring polynomials with rational coefficients
• A taxonomy of pairing-friendly elliptic curves
• The Arithmetic of Elliptic Curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Pairing-Friendly Elliptic Curves of Prime Order
• Title not available (Why is that?)
• Elliptic curves. Number theory and cryptography
• The Weil pairing, and its efficient calculation
• Faster hashing to \({\mathbb G}_2\)
• The Eta Pairing Revisited
• Advances in Elliptic Curve Cryptography
• Title not available (Why is that?)
• Nonsingular plane cubic curves over finite fields
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Implementing cryptographic pairings
• Title not available (Why is that?)
• Indifferentiable hashing to Barreto-Naehrig curves
• How to Hash into Elliptic Curves
• Algorithmic Number Theory
• Extended tower number field sieve: a new complexity for the medium prime case
• On the size of pairing-based non-interactive arguments
• Guide to pairing-based cryptography
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• LOVE a pairing
• Fast Hashing to G 2 on Pairing-Friendly Curves
• 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
• Curves with Fast Computations in the First Pairing Group
• Families of SNARK-friendly 2-chains of elliptic curves
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
• Co-factor clearing and subgroup membership testing on pairing-friendly curves

Cited In (1)

• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves

This page was built for publication: Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists

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