Thursday, November 15, 2012

Section 19.1 and 19.2, due November 16

I had a little trouble understanding the explanation in the beginning about the polarity of particles and how that applies to sending messages through quantum cryptography.

The most interesting part of this section was definitely the mention of the possibility of factoring integers in polynomial time using an appropriate quantum computer.  If this exists now, that could mean that RSA is totally open to anyone who has it.  However, I have no idea what the actually likelihood is of the existence of a quantum computer is, or what a quantum computer is even, but I definitely want to know more.

No comments:

Post a Comment