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: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2020
|