What does this mean for the world of cryptography?

Some dudes in India recently developed an algorithm to test for the primality of arbitrarily large numbers with a polynomial-time algorithm. Check here for a link to the site. My question is does this render more commonplace computer systems/networks capable of breaking encrypted data that was traditionally left to the realm of supercomputers using less efficient algorithms? You can download a PDF file from the website, it explains the algorithm and the math behind it.