if in a curve y2 mod p = x3+ 7 mod p ( ecdsa-secp256k1)





How do i find 'n' ?

  • 5
    This requires solving the discrete logarithm problem, which is assumed to be infeasible. If it wasn't, elliptic curve cryptography would be insecure. – Pieter Wuille Feb 14 '19 at 9:13
  • Correction: solving this problem when n is uniformly randomly chosen is assumed to be infeasible. – Pieter Wuille Feb 15 '19 at 3:57

You can find n by consulting a discrete log oracle, such as myself. N is 5. You're welcome.

| improve this answer | |
  • 1
    Is it possible to learn this power? – Pieter Wuille Feb 15 '19 at 3:48
  • 1
    I'm afraid you might not be random enough. – G. Maxwell Feb 15 '19 at 6:10

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.