You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Wahby, R. S., & Boneh, D. (2019). Fast and simple constant-time
hashing to the bls12-381 elliptic curve. IACR Transactions on
Cryptographic Hardware and Embedded Systems, nil(nil), 154–179. http://dx.doi.org/10.46586/tches.v2019.i4.154-179
Koshelev, D. (2021). Indifferentiable hashing to ordinary elliptic
f_$\backslash$!q-curves of j= 0 with the cost of one exponentiation
in f_$\backslash$!q. IACR Cryptol. ePrint Arch., 2021(), 301.
Koshelev, D. (2021). Faster indifferentiable hashing to elliptic
$$\backslash$mathbb $$F$$ _ $$$\backslash$! q^ 2$$ $-curves.
Cryptology ePrint Archive, (), .
The text was updated successfully, but these errors were encountered:
Specifically comparing
Wahby, R. S., & Boneh, D. (2019). Fast and simple constant-time
hashing to the bls12-381 elliptic curve. IACR Transactions on
Cryptographic Hardware and Embedded Systems, nil(nil), 154–179.
http://dx.doi.org/10.46586/tches.v2019.i4.154-179
Koshelev, D. (2021). Indifferentiable hashing to ordinary elliptic
f_$\backslash$!q-curves of j= 0 with the cost of one exponentiation
in f_$\backslash$!q. IACR Cryptol. ePrint Arch., 2021(), 301.
Koshelev, D. (2021). Faster indifferentiable hashing to elliptic$$F$$ _ $$$\backslash$! q^ 2$$ $-curves.
$$\backslash$mathbb
Cryptology ePrint Archive, (), .
The text was updated successfully, but these errors were encountered: