Hashing to elliptic curves $y^2 = x^3 + b$ provided that $b$ is a quadratic residue

Cryptography
4

Oh, that’s great! I’m pleased to see you changed your opinion from earlier this year:

A few questions:

  1. How much faster is the hashing compared to Wahby-Boneh?
  2. Have you tried implementing the function?

Can you expand on this? Does this imply that your hash function does not behave like a random oracle (unlike Wahby-Boneh)?