Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Compare efficiency of different approaches for hash2curve for the case of BLS12-377 #9

Open
drskalman opened this issue Oct 15, 2021 · 0 comments
Assignees

Comments

@drskalman
Copy link
Collaborator

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
    $$\backslash$mathbb $$F$$ _ $$$\backslash$! q^ 2$$ $-curves.
    Cryptology ePrint Archive, (), .

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants