I want to wrap my head around RSA or Elliptic Curve verification. My end goal is to write a simple toy where Alice can enter “Alice” as a string identifier and produce a string/byteslice that Bob can use to verify that the message is coming from Alice and not Charley. I’ve used Bcrypt before to secure passwords on a personal utility of mine (for clarification, I have not produced something that requires security that I wrote that someone else trusted) and was able to understand that well enough, but for some reason I’ve been running into this mental wall with this one. I’ve read the go docs on RSA and Elliptic Curve, but for some reason, I’m just not understanding this.
This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.