Curves mod p are what we started to talk a little bit about yesterday, which was good because I liked Math 371 so talking about rings and groups feels more familiar than some of the other material that we have covered this semester. Also we talked about "addition" so that concept makes sense.
Is the method for finding out the number of points beyond anything that we will cover? It seems like even if there was some kind of basic algorithm it could be nicer than counting everything up. unless its a small graph.
Nit-picky I know but I dislike how the book says "this might not look like a log problem, but it is clearly the analog of the log problem...." if it doesn't look like it, how is it clearly it?
So is it possible that when you are choosing a ciphertext or making one I guess that it doesnt work and doesnt code? Or what is it exactly that is failing?
No comments:
Post a Comment