Discovery of a polynomial time deterministic test for primality:

Prof. Manindra Agarwal and two of his students *, Nitin Saxena and Neeraj
Kayal (both BTech from CSE/IITK who have just joined as Ph.D. students),
have discovered a polynomial time deterministic algorithm to test if an
input number is prime or not. Lots of people over (literally!) centuries
have been looking for a polynomial time test for primality, and this result
is a major breakthrough, likened by some to the P-time solution to Linear
Programming announced in the 70s.

       http://www.cse.iitk.ac.in/news/primality.html

[[While this discovery will by itself not shake up the cryptography world as
the method is slower than existing probability based search routines, it
suggests the *possibility* of an equally simple technique for determining
factors of non prime numbers which would destroy several cryptographic
systems.]]

Full paper ( 9 pages) in PDF format

        http://www.cse.iitk.ac.in/news/primality.pdf


* Actual discovery was by ... ? :-)

--
http://www.piclist.com hint: The PICList is archived three different
ways.  See http://www.piclist.com/#archives for details.