1. I didn't quite follow how the explanation for an approximate value for number of points mod p. I also didn't understand the discrete logarithms on elliptic curves. I don't see how B=kA for some integer k relates to a discrete logarithm problem.
2. I actually understood the elliptic curve cryptosystem mentioned worked for the most part. It seems kind of like it isn't all that efficient as there is a possibility of performing many operations to find a square root of x^3+bx+c for x=mK+j. I am interested in an example when there is a mod of a composite such as the example in 16.1 and how elliptic curves can lead to factoring the composite.
No comments:
Post a Comment