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, and that it is…
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, and that it is… cybersecurity
Overcoming Dragonblood Hashing Data Elliptic Curve Point Scalar Constant Time Let’s say almost 2²⁵⁶ integer point value give u 115792089237316195423570985008687907853269984665640564039457584007913129639936 different xy point find way hash data onto one point possible know data resulted point is… cybersecurity