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

DOI10.1007/s00200-020-00453-9zbMath1490.14044OpenAlexW3042928484MaRDI QIDQ2140834

Federico Pintore, Alessandro Budroni

Publication date: 23 May 2022

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-020-00453-9

zbMATH Keywords

pairing-based cryptographypairing-friendly elliptic curvesfast hashing

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (3)

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

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Factoring polynomials with rational coefficients
• MOV attack in various subgroups on elliptic curves
• Short signatures from the Weil pairing
• Updating key size estimations for pairings
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Elliptic curves suitable for pairing based cryptography
• The Tower Number Field Sieve
• Guide to Pairing-Based Cryptography
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Faster Hashing to ${\mathbb G}_2$
• Fast Hashing to G 2 on Pairing-Friendly Curves
• The Eta Pairing Revisited
• Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
• Choosing the correct elliptic curve in the CM method
• Pairing Lattices
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Pairing-Friendly Elliptic Curves of Prime Order
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• Algorithmic Number Theory

This page was built for publication: Efficient hash maps to \(\mathbb{G}_2\) on BLS curves