Cryptography [Elliptic curve over Fp] Is there a way to calculate x by having y?

---

[Elliptic curve over Fp] Is there a way to calculate x by having y? Posted: 21 Dec 2018 02:13 AM PST Given an elliptic curve over Fp with equation y2≡x3+ax+b (mod p) Finding y by having x is a matter of calculating modular square root of the right side. But what I am looking for is calculating x by having y and am wondering if there is a way for all curves with different values for a and b. If not, is there any special cases where this calculation is possible? submitted by /u/Coding_Enthusiast [link] [comments]

You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States