I will be joining Cornell University as an Assistant Professor in the Computer Science Department starting Fall 2018.

Currently I am a postdoctoral researcher under Avi Wigderson in the School of Mathematics at the Institute for Advanced Study in Princeton. I am also affiliated with the Simons Collaboration on Algorithms and Geometry. I spent the Spring '17 semester at the Simons Institute in UC Berkeley as a Microsoft Research Fellow in the Pseudorandomness program.

Previously, I finished my PhD in Computer Science at UT Austin under the brilliant guidance of David Zuckerman. Even before that, I was an undergrad in the computer science department at IIT Kanpur.

My primary area of research is theoretical computer science. In particular, I am interested in complexity theory, pseudorandomness and cryptography.

An article about my research targeted towards general audience: How random is your randomness, and why does it matter?, with David Zuckerman.

Articles in CACM, Science News, UT News, and blogposts (Oded Goldreich's post, Gil Kalai's post) about my research.

Here is a CV.

Program Committees: FSTTCS 2017, FOCS 2018

Gil Cohen, Xin Li and I are organizing a workshop on randomness extractors in STOC 2018 TheoryFest.


  • Simple and efficient pseudorandom generators from Gaussian processes
    Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
    Manuscript 2018
  • Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More
    Eshan Chattopadhyay, Xin Li
    Manuscript 2018
  • Privacy Amplification from Non-Malleable Codes
    Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
    Manuscript 2018
  • Pseudorandom Generators from Polarizing Random Walks
    Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
    CCC 2018, Invited to ToC special issue
  • A New Approach for Constructing Low-Error, Two-Source Extractors
    Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
    CCC 2018
  • Improved Pseudorandoness for Unordered Branching Programs through Local Monotonicity
    Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
    STOC 2018
  • Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions
    Eshan Chattopadhyay, Xin Li
    STOC 2017
  • Explicit Two-Source Extractors and More
    PhD Thesis, 2016.
    Bert Kay Dissertation Award (given for the best doctoral thesis in computer science at UT Austin)
  • Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols
    Eshan Chattopadhyay, Xin Li
    FOCS 2016
  • Explicit Two-Source Extractors and Resilient Functions
    Eshan Chattopadhyay, David Zuckerman
    STOC 2016, Best Paper Award
  • Extractors for Sumset Sources
    Eshan Chattopadhyay, Xin Li
    STOC 2016
  • Non-Malleable Extractors and Codes, with their Many Tampered Extensions
    Eshan Chattopadhyay, Vipul Goyal, Xin Li
    STOC 2016
  • New Extractors for Interleaved Sources
    Eshan Chattopadhyay, David Zuckerman
    CCC 2016
  • Non-Malleable Codes Against Constant Split-State Tampering
    Eshan Chattopadhyay, David Zuckerman
    FOCS 2014
  • On Low Discrepancy Samplings in Product Spaces of Motion Groups
    Chandrajit Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman
    Manuscript, 2014
  • An Explicit VC-Theorem for Low-Degree Polynomials
    Eshan Chattopadhyay, Adam Klivans, Pravesh Kothari
    RANDOM 2012