Eyeing a million-dollar prize, a mathematician claims to have made progress in solving a 150-year-old riddle. The solution to the problem could render secure payments and other sensitive Internet transactions vulnerable.

A Purdue University professor has begun to publish what he claims is a proof of the Riemann hypothesis. The hypothesis, which dates from 1859, attempts to show that there in fact are connections in apparently random sets of prime numbers, which are heavily used in developing cryptographic code.
http://www.ecommercetimes.com/story/36427.html