Dr. Neeraj Kayal


Dr. Kayal graduated with a B.Tech from the Computer Science Department of the Indian Institute of Technology, Kanpur (IITK), India in 2002. In that year, he, Manindra Agrawal and Nitin Saxena proposed the AKS Primality Test, which attracted worldwide attention, including an article in the New York Times.


Dr. Kayal received his PhD in theoretical computer science from the Department of Computer Science and Engineering at the Indian Institute of Technology, Kanpur in 2007. He did postdoctoral research at the Institute for Advanced Study in Princeton and at Rutgers University. Since 2008, he has been working with the Microsoft Research Lab India as a researcher.Dr. Kayal's main interests include algebra, geometry, number theory and their applications in computer science. His recent work has been focused on optimal ways of computing arithmetic functions. Previously, Dr. Kayal was part of the team that discovered the first provably efficient algorithm for testing primality. Dr.Neeraj Kayal was conferred with the Distinguished Alumnus Award, 2003 from IIT Kanpur.

Achievements and Honors

  • Awarded the Young Scientist Award in 2012 from the Indian National Science Academy (INSA) for contributions to the development of arithmetic complexity theory including the development of a deterministic algorithm for primality testing, the resolution of the constant fan-in conjecture for depth three circuits, and a reconstruction algorithm for arithmetic formulas.
  • Recipient of the Godel prize, 2006.
  • Recipient of Fulkerson Prize, 2006
  • Recipient of the Distinguished Alumnus Award of the IIT Kanpur, 2003.