Faster hashing to G₂

DOI10.1007/978-3-642-28496-0_25MaRDI QIDQ2889888zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

fast hashingfinal exponentiationpairing-based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic varieties and schemes; Arakelov theory; heights (14G40) Cryptography (94A60)

Recommendations

• Fast Hashing to G 2 on Pairing-Friendly Curves
• Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• Faster explicit formulas for computing pairings over ordinary curves
• Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)

Cites work

• A taxonomy of pairing-friendly elliptic curves
• Algorithmic Number Theory
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Cryptography and Coding
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Efficient pairing computation on supersingular abelian varieties
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Factoring polynomials with rational coefficients
• Fast Hashing to G 2 on Pairing-Friendly Curves
• Faster explicit formulas for computing pairings over ordinary curves
• Faster squaring in the cyclotomic subgroup of sixth degree extensions
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• 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 5532069 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 3078637 (Why is no real title available?)
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• On vectorial addition chains
• Optimal Pairings
• Pairing Lattices
• Pairing-Friendly Elliptic Curves of Prime Order
• The Eta Pairing Revisited
• The Weil pairing, and its efficient calculation

Cited in

(18)

• Choosing and generating parameters for pairing implementation on BN curves
• Updating key size estimations for pairings
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• Memory-saving computation of the pairing final exponentiation on BN curves
• Subgroup security in pairing-based cryptography
• Fast Hashing to G 2 on Pairing-Friendly Curves
• Efficient implementation of bilinear pairings on ARM processors
• Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
• Adequate elliptic curves for computing the product of n pairings
• 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
• scientific article; zbMATH DE number 7746256 (Why is no real title available?)
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• An algebraic point of view on the generation of pairing-friendly curves
• Revisiting pairing-friendly curves with embedding degrees 10 and 14
• A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
• Low-cost addition-subtraction sequences for the final exponentiation in pairings

This page was built for publication: Faster hashing to \({\mathbb G}_2\)

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