Faster Hashing to ${\mathbb G}_2$
From MaRDI portal
Publication:2889888
DOI10.1007/978-3-642-28496-0_25zbMath1292.94063OpenAlexW129300768MaRDI QIDQ2889888
Laura Fuentes-Castañeda, Edward Knapp, Francisco Rodríguez-Henríquez
Publication date: 8 June 2012
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28496-0_25
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Arithmetic varieties and schemes; Arakelov theory; heights (14G40)
Related Items (12)
Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Efficient Implementation of Bilinear Pairings on ARM Processors ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ A survey of elliptic curves for proof systems ⋮ 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 ⋮ Unnamed Item ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Updating key size estimations for pairings ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Efficient pairing computation on supersingular abelian varieties
- Point Decomposition Problem in Binary Elliptic Curves
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- The Eta Pairing Revisited
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Pairing Lattices
- 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
- On vectorial addition chains
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Cryptography and Coding
- Algorithmic Number Theory
This page was built for publication: Faster Hashing to ${\mathbb G}_2$
