Is there a way to hash the following hash functions h1 : G1 → Z ∗ q , h2 : {0, 1}∗ → Z ∗ q using some Standard algorithm?

Asked Mar 25 '21 at 13:15

Active Mar 25 '21 at 13:15

Viewed 102 times

Given that G1 is elliptical curve group and q is prime no. Here elements of G1 will be of form (X,y) coordinates

h1 : G1 → Z ∗ q

h2 : {0, 1}∗ → Z ∗ q

How should the sha algorithm be modified to use for the above hash functions which are collision resistant as well?

asked Mar 25 '21 at 13:15

Mugdha Kolhe

Sha algorithm calculates hash of string to some fixed length string. So how to modify that algo? – Mugdha Kolhe Mar 25 '21 at 13:17
Since it is easy to serialize an element of G1 or {0,1}* for hashing, the real question is how to create an element of Zq without a bias. – Artjom B. Mar 25 '21 at 22:13
Here you can see a Java implementation of what you need: https://stackoverflow.com/a/66233365/1816580 – Artjom B. Mar 25 '21 at 22:14

0 Answers0