1. It was a very well written article. It didn't use hardly any math (except periods and mods). But there were still a few issues I had with it. Finding phi(n) corresponds to finding a multiple of the period mod some N. However, how does one choose N? I'm still having trouble figuring out how to choose N. Furthermore, once one DOES choose N, and finds the period then how can one be sure of the corresponding phi(n)? For example, in the article they let N=15 and found the period to be 6 and phi(n)=12 and explained that sure enough 6 divides 12. When I read this, I thought, "but 6 also divides 24 and 36 and 66, etc." How can I find phi(n) based solely on the period?
2. There was a part explaining something called repeated squaring. It seems to me that's the same as our exponentiating a number mod n that we've learned. On another note, or maybe this would best fit under the previous section, it seems like this article would fit better under our section that examined RSA rather than quantum cryptosystems?
No comments:
Post a Comment