Latest news with #ACMSymposiumonTheoryofComputing
News18
a day ago
- Science
- News18
Meet Eshan Chattopadhyay, Indian-Origin Cornell Professor, IIT Grad, Awarded Gödel Prize
Last Updated: From IIT-Kanpur to Gödel Prize: Eshan Chattopadhyay's work reshapes randomness and complexity theory. Eshan Chattopadhyay, an Indian-origin computer scientist and associate professor at Cornell University, has won the 2025 Gödel Prize. The Gödel Prize is one of the top honours in theoretical computer science. He shares the award with David Zuckerman of the University of Texas at Austin for a groundbreaking paper that tackles a long-standing challenge in computing: how to generate high-quality randomness from unreliable or weak sources. The research paper, titled 'Explicit Two-Source Extractors and Resilient Functions", was first presented in 2016 at the ACM Symposium on Theory of Computing, where it won the Best Paper award and was later published in the Annals of Mathematics in 2019. Chattopadhyay's work dives into randomness extraction, a crucial area in computer science and cryptography. One may think of it like this: if one had two rigged coins, this method would still find a way to give them fair, unpredictable outcomes. Though it might sound abstract to the uninitiated, its real-world impact is massive. Good randomness is the foundation of everything from secure communications and encryption to complex algorithms and data privacy. Without it, modern digital infrastructure becomes fragile. The paper's ideas have helped reshape how researchers approach pseudo-randomness, complexity theory and secure system design. Chattopadhyay, who did his BTech from IIT-Kanpur in 2011 and PhD from the University of Texas, has also held prestigious research positions at the Institute for Advanced Study in Princeton and the Simons Institute in Berkeley. Reacting to the award, he told Cornell it felt 'surreal and gratifying" to see his work recognised on such a global stage, as reported by LiveMint. The prize is jointly awarded by Special Interest Group on Algorithms and Computation Theory (ACM SIGACT) and the European Association for Theoretical Computer Science. The prize includes a $5,000 award. It recognises papers that have made lasting contributions to the field, both in theory and long-term relevance. Get breaking news, in-depth analysis, and expert perspectives on everything from geopolitics to diplomacy and global trends. Stay informed with the latest world news only on News18. Download the News18 App to stay updated!
Mint
3 days ago
- Science
- Mint
Who is Eshan Chattopadhyay? All about Indian-origin professor awarded prestigious Godel Prize
Eshan Chattopadhyay, an Indian-origin computer scientist and associate professor at Cornell University, has received the 2025 Gödel Prize—one of the highest recognitions in the field of theoretical computer science. He shares the award with David Zuckerman of the University of Texas at Austin for their influential research on randomness extraction—an area crucial to encryption, cybersecurity, and algorithm design. The award was given for his breakthrough research paper titled 'Explicit Two-Source Extractors and Resilient Functions', which addresses a key challenge in computer science: how to generate high-quality randomness from unreliable sources, critical for secure computing and cryptographic systems. Published initially at the ACM Symposium on Theory of Computing (STOC) in 2016, where it also won the Best Paper award, and later in the Annals of Mathematics in 2019, the paper introduced new techniques that have since shaped major advances in pseudo-randomness and complexity theory. Chattopadhyay completed his BTech in computer science from IIT Kanpur in 2011, followed by a PhD at the University of Texas in 2016. He later held postdoctoral positions at the Institute for Advanced Study in Princeton and the Simons Institute for the Theory of Computing at UC Berkeley, two of the most prominent institutions in the field. Named after legendary logician Kurt Gödel, the Gödel Prize is jointly awarded by the ACM SIGACT and the European Association for Theoretical Computer Science. It honours papers that have made lasting contributions to the field of theoretical computer science. The research deals with randomness extraction- a fundamental concept in computer science and cryptography. It focuses on creating reliable randomness from two flawed or weak random sources, a challenge that has implications for everything from encryption systems to algorithm design. In simple terms, imagine flipping two unfair coins and still being able to extract fair, unpredictable results. That's the essence of what Chattopadhyay and Zuckerman achieved, turning weak inputs into strong, usable randomness. He told Cornell University that the recognition is an incredible honour. He shared that it feels 'surreal and gratifying' that the paper was placed in that category.
