## Prime Number Detection Algorithm

Very few people are aware of the fact that three students of IIT Kanpur have successfully devised and implemented an unconditional, deterministic, polynomial-time algorithm to determine if an input number is prime or composite. This is a very important discovery, should I say, in the history of mankind, and we must be proud that this feat has been achieved by Indians. This discovery has long-ranging effects on the way modern cryptography is approached.

Few of us might understand the content of their discovery, but this is officially labeled as “simple”, so you might as well have a look:

Goes a long way in proving the intellectual quality of Indian students.

http://logic.pdmi.ras.ru/ics/papers/pinp.pdf

я так считаю: бесподобно…

плешкаDecember 17, 2009 at 11:26 pm