Quote from: james5000 on Today at 02:02:52 AM

Quote from: digaran on Today at 01:55:58 AM

Quote from: james5000 on Today at 12:48:45 AM

for n = fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

Code:

print(toHex(round(n / 6)))

my result is 2aaaaaaaaaaaaa00000000000000000000000000000000000000000000000000

Sad

but what I meant is whether there is a way to divide a point on the curve x, y by another point on the curve x, y?

Your result is not correct because n is not divisible by 5, you should do the math mod n to have the correct result.

Anyways, point by point multiplication and division without knowing at least one point's private key is impossible, why else they call it crypto-graphy for?
If it was possible directly, we all could break ECC easily.

Ps, I'm not a mathematician, but I'll find a way to divide point by point or die trying! 🤣

work with me 🤣🤣

If the private key of a point is known, you can divide the other point, for this you take the inverse of the private key of the known point and multiply by the point, multiplying with the inverse is equal to dividing the point.

Not: My native language is not english i translate from google sorry for the translation errors