News for hackers. Stuff that matters.
Re:Basic Intro to Elliptic Curve Cryptography (2019) by lordnacho on Sunday May 31, 2020 @12:09PM (#23370442)
> I'm assuming that given a starting point A and a number of operations n, there's a much faster way of computing the end point than just iterating n times?

Yes, this is in fact the basis of the cryptographic security. There's a way to iterate the generator whatever number of times, fast. This is called multiplication, just like there's a way to multiply arithmetic numbers in school without adding over and over.

The thing is it isn't quite so easy given the starting point and the result what you multiplied by.

Re:Basic Intro to Elliptic Curve Cryptography (2019) by alecbenzer on Sunday May 31, 2020 @06:37PM (#23373539)
Right, but while most people understand multiplication, it doesn't seem clear how to efficiently perform repeated application of the dot operation. I'm guessing the operation is associative, which lets you do it fast.