Fast Hashing to G 2 on Pairing-Friendly Curves

DOI10.1007/978-3-642-03298-1_8zbMath1248.94094OpenAlexW1542440187MaRDI QIDQ3392906

No author found.

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)

Related Items

Faster Hashing to ${\mathbb G}_2$ ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ Updating key size estimations for pairings ⋮ A Multivariate Encryption Scheme with Rainbow ⋮ Faster Pairings on Special Weierstrass Curves

Cites Work

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

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