Now Searchable!
journal of
science education
Research News
A Polymomial Time Algorithm to Test if a Number is a Prime or Not
| Manindra Agrawal (36), Professor of Computer Science and Engineering at the Indian Institute of Technology, Kanpur, along with two BTech students of his, Neeraj Kayal (22) and Nitin Saxena (21) have solved the age old problem of finding a ‘polynomial time’ algorithm that decides whether a given number is a prime or not. Such an algorithm has been eluding the best mathematicians and computer scientists for several decades. This problem besides being of intrinsic theoretical interest has many practical implications in designing encryption algorithms used to protect data stored in computers and transmitted via communication networks. |
Read full article (35 Kb)
Indian Academy of Sciences
C.V.Raman Avenue, Post Box No. 8005,
Sadashivanagar Post, Bangalore 560 080
Tel: 91-80-3612546, 3614592, 3612943
Fax: 91-80-361 6094
email: resonanc@ias.ernet.in
URL: http://www.ias.ac.in