Primes in P

[Fabio Coatti]

I've read an interesting headline on slashdot, that maybe can have some 
impact in cryptography:

Posted by chrisd on Wednesday August 07, @12:08AM

from the cats-and-dogs-living-together dept.
zorba1 writes "Manindra Agrawal et. al. of the Indian Institute of Technology 
Kanpur CS department have released a most interesting paper today.  It 
presents an algorithm that determines whether a number is prime or not in 
polynomial time.  While I haven't gone through the presentation in detail, it 
looks like a promising, albeit non-optimized, solution for the famous PRIMES 
in P problem."

-- 
Fabio Coatti       http://www.ferrara.linux.it/members/cova     
Ferrara Linux Users Group           http://ferrara.linux.it
GnuPG fp:9765 A5B6 6843 17BC A646  BE8C FA56 373A 5374 C703
Old SysOps never die... they simply forget their password.