Manindra Agrawal, a mathematician with the Indian Institute of Technology, Kanpur, India, who is currently conducting research at the Institute for Advanced Study in Princeton, New Jersey, USA, is the winner of the 2003 ICTP Prize. The announcement was made last month. With the help of two undergraduate students (Neeraj Kayal and Nitin Saxena), Agrawal recently deciphered the polynomial-time algorithm for testing whether a given number is a prime number (solving the so-called 'primality problem'). In addition to its importance in number theory, 'primality' plays a key role in computational complexity and is also a fundamental tool of analysis in modern cryptography. The award ceremony will take place later this year in Trieste.