Efficient hash maps to G2 on BLS curves
When a pairing e:G1×G2→GT, on an elliptic curve E defined over a finite field Fq, is exploited for an identity-based protocol, there is often the need to hash binary strings into G1 and G2. Traditionally, if E admits a twist E~ of order d, then G1=E(Fq)∩E[r], where r is a prime integer, and G2=E~(Fq...
Main Authors: | Budroni, A, Pintore, F |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2020
|
Similar Items
-
Efficient hash maps to 픾2 on BLS curves
by: Budroni, A, et al.
Published: (2017) -
Hashing to G2 on BLS pairing-friendly curves
by: Budroni, A, et al.
Published: (2018) -
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
by: Riad S. Wahby, et al.
Published: (2019-08-01) -
On hashing into elliptic curves
by: Farashahi Reza R., et al.
Published: (2009-12-01) -
Attending Training Workshop of BLS/ACLS
by: Priya Yadav
Published: (2022-10-01)