The subject was more an attention grabber than an actuality. It comes from an article i read in the science section of the local paper this morning about a "Million dollar math problem." The thing that caught my eye was a line about its application to cryptography.

Im nowhere near an expert, or even knowlegeable of encryption methods etc, but after a quick search of the web, i found a news site that had a similar story on it.
http://www.extremetech.com/article2/...,341723,00.asp

It is about Rieman's 143 year old hypothesis that uses Rieman's own "zeta function" to estimate primes. Apparently, understanding the logic behind this approach, and why it works has been under speculation for quite some time now, and if it is ever found, could impact our ability to bypass encryption standards.

Considering that most encryption schemes rely on the difficulty of determining if a number is a prime, if this hypothesis is proven,we may need to head back to the security blackboard.
If anyone happens to be a math genius, this site explains the problem in an "elementary way" (lol)

The first site is a pretty quick read, and easy to understand and kind of interesting. Check it out.