Fast Hashing to G 2 on Pairing-Friendly Curves

DOI10.1007/978-3-642-03298-1_8MaRDI QIDQ3392906zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Tate pairingaddition chains

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1689862 (Why is no real title available?)
• scientific article; zbMATH DE number 438988 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• A taxonomy of pairing-friendly elliptic curves
• Advances in Elliptic Curve Cryptography
• Algorithmic Number Theory
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• On vectorial addition chains
• Pairing-Friendly Elliptic Curves of Prime Order
• The Eta Pairing Revisited

Cited in

(13)

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

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)