Fast Hashing to G 2 on Pairing-Friendly Curves

DOI10.1007/978-3-642-03298-1_8zbMATH Open1248.94094OpenAlexW1542440187MaRDI QIDQ3392906FDOQ3392906

Authors:

Publication date: 18 August 2009

Published in: Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03298-1_8

Recommendations

• 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
• scientific article; zbMATH DE number 1962162
• The Eta Pairing Revisited

zbMATH Keywords

Tate pairingaddition chains

Mathematics Subject Classification ID

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

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Pairing-Friendly Elliptic Curves of Prime Order
• The Eta Pairing Revisited
• On vectorial addition chains
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Advances in Elliptic Curve Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Algorithmic Number Theory
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field

Cited In (13)

• A multivariate encryption scheme with Rainbow
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
• Subgroup security in pairing-based cryptography
• Updating key size estimations for pairings
• Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• Hashing to elliptic curves of \(j=0\) and Mordell-Weil groups
• 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
• Faster hashing to \({\mathbb G}_2\)
• Faster Pairings on Special Weierstrass Curves
• On cycles of pairing-friendly abelian varieties
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms

This page was built for publication: Fast Hashing to G 2 on Pairing-Friendly Curves

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