1. After looking at the website and then the book, I still have a little bit of confusion. At the beginning of the chapter, they talk about how we are trying to find an a and r such that a^r = 1(mod p) but in the example, we get to the point where 11^x-y = 1 (mod p). I think that's the point we were trying to get to, but wouldn't x-y=0? Maybe I am wrong, but I didn't think that this would work.
2. I was very surprised in the example when they said that a quantum computer couldn't use 21 like we could do in the example in our book! It seems like such a small number, and it shows we still have some progress to make in this field! It makes me think about how conspiracists believe that the NSA has a super quantum computer that could do anything! That would be interesting if they did, and would actually probably help public advancements in the future!
No comments:
Post a Comment