Photo by Tim Mossholder on Unsplash

Overcoming Dragonblood: Hashing Data To An Elliptic Curve Point (or Scalar) In A Constant Time

Let’s say we have almost 2²⁵⁶ integer point values. This will give us 115,792,089,237,316,195,423,570,985,008,687,907,853,269,984,665,640,564,039,457,584,007,913,129,639,936 different (x,y) points. Can we find a way to hash some data onto one of these points, and so it is not possible to know the data that resulted in that point…