News for hackers. Stuff that matters.
Re:Basic Intro to Elliptic Curve Cryptography (2019) by neikos on Sunday May 31, 2020 @12:12PM (#23370472)
> ould just be a matter of iterating from A until you hit the end point and counting, right?

Yes, you could brute-force all the points. The good thing is, ECC is done on fields that are very large, so that actually enumerating them is not practical. Check out Curve25519[1] for some numbers.

[1]: https://en.wikipedia.org/wiki/Curve25519

Re:Basic Intro to Elliptic Curve Cryptography (2019) by alecbenzer on Sunday May 31, 2020 @06:27PM (#23373435)
Right, but the point is that doing the transformation in one direction needs to be fast in order of the scheme to be viable. So there must be some faster way of doing n iterations, which the post doesn't mention.