I was in MAT 140 – Discrete Mathematics last quarter and I found that the fundamental theorem of arithmetic is super interesting. When the professor was speaking about it, I asked if it was the base for PGP encryption and it turned out it was. I had an inkling for this, because I previously heard that PGP generates super large numbers and that’s where the security lies.

I’m kind of skeptical. Sure, with the current state of computing these cryptography keys are nearly impossible to crack, but the fact is that they still are possible to crack. I’m betting on sooner rather than later.

Well, I’ll be looking into how this works in greater detail whenever I have time.

Anyone know some places to learn more?