Show Posts
I'm guessing finding a way to implement a backdoor on a curve is extremely difficult, otherwise we could have seen such curves by now.
The only thing I could think of, is having a special number which when divided/multiplied by any point on curve mod some other special number resulting in the private key for that point.
I strongly believe there are such numbers/ values to just do that, but the question is how? Math+ECC expert could figure that out.
The only thing I could think of, is having a special number which when divided/multiplied by any point on curve mod some other special number resulting in the private key for that point.
I strongly believe there are such numbers/ values to just do that, but the question is how? Math+ECC expert could figure that out.
I AGREE
, 3 years before i am thinking & i found iti am useing. my tiny brain with little math. I FIND strange_63_digest_PRIVATE i am trying to divided/multiplied == result is same
60f4d11574f5deee49961d9609ac6 / strange_63_digest_PRIVATE = same result
60f4d11574f5deee49961d9609ac6 * strange_63_digest_PRIVATE = same result
i am trying to connet n & p Unknow behavior for p= 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f (t = 977)
n 100% working strange_63_digest_PRIVATE divided/multiplied == result is same
n or p which one fist create ?
answer:
ecdsa developer fist create n
2nd connect to p thats it
share p-values topic thank
Edit:
any idea for ( strange_63_digest_PRIVATE , x ,y )mod n == 60f4d11574f5deee49961d9609ac6 , its possible
( strange_63_digest_PRIVATE , x ,y )mod p == 60f4d11574f5deee49961d9609ac6 , its possible
etc.....
any formula ??....
sorry my poor English ...
