Divesh Aggarwal
Principal Investigator
+65 6516 5628
Divesh Aggarwal

Short bio

Divesh Aggarwal has received Ph.D. degree in Computer Science from ETH Zurich in 2012. From 2012 to 2016, he spent two years each as a postdoctoral researcher at New York University and at EPFL. Since 2016, he is an Assistant Professor in the Department of Computer Science, and a Principal Investigator in the Centre for Quantum Technologies at the National University of Singapore. His research interests include lattices, pseudorandomness, cryptography, coding theory, algorithms, and computational complexity.


  • D. Aggarwal, P. Mukhopadhyay. Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm.
  • , Marco Tomamichel, M. Santha, Gavin K. Brennen, D. Aggarwal, T. Lee. Quantum attacks on Bitcoin, and how to protect against them.
  • D. Aggarwal, Kai-Min Chung, H.H. Lin, T. Vidick. A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries.


  • D. Aggarwal, N. Stephens-Davidowitz. (2018). (Gap/S)ETH Hardness of SVP. ACM STOC
  • D. Aggarwal, A. Joux, A. Prakash, M. Santha. (2018). A new public-key cryptosystem via Mersenne numbers. CRYPTO
  • D. Aggarwal, Noah Stephens-Davidowitz. (2018). Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). Proceedings of the Symposium on Simplicity in Algorithms
  • D. Aggarwal, M. Obremski, T. Kazana. (2017). Inception makes non-malleable codes stronger. Theory of Cryptography
  • , O. Regev, D. Aggarwal. (2016). A Note on Discrete Gaussian Combinations of Lattice Vectors. CJTCS 1
  • , U. Maurer, D. Aggarwal. (2016). Breaking RSA Generically Is Equivalent to Factoring. IEEE Transactions on Information Theory 62 6251-6259
  • D. Aggarwal, C. Dubey. (2016). Improved hardness results for unique shortest vector problem. Inf. Proc. Lett 116 631-637
  • , S. Lovett, K. Hosseini, D. Aggarwal. (2016). Affine-malleable extractors, spectrum doubling, and application to privacy amplification. IEEE ISIT