Difficult: The discrete logarithm problem looked difficult, I didn't understand very well why n had to be the smallest positive integer such that alpha^n is congruent to 1 mod p for us to get that x=(L_alpha)(beta) though. Could you explain why in class?
Interesting: It's crazy how many people and computers it took to find the congruence relations of the desired type for this problem! and then how relatively they were able to reduce the matrix and determine the dependencies. I also thought the message was pretty interesting... mostly weird, but I guess it makes sense since they didn't want anyone to just arbitrarily guess what it was and get the moneys without doing the work.
No comments:
Post a Comment