Today was on elliptic curves and encrypting messages. The problem is similar to the discrete logarithm problem. With the added complication that there is a chance that your message will be unable to be encrypted. The message is encypted by taking the message, turning it into a number and that number becomes the x coordinate of the point that represents the plaintext. But I can't find out how the message is encoded. Elliptic curves can be used to factor polynomials.
So the method of encryption has to do with the fact that if B=kA, for a given B and A, k is hard to find.
No comments:
Post a Comment