Divesh Aggarwal
Principal Investigator
S15-04-12
dcsdiva@nus.edu.sg
65165628
Divesh Aggarwal

Preprints

  • P. Mukhopadhyay, D. Aggarwal. Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm.
  • , M. Santha, T. Lee, D. Aggarwal, Marco Tomamichel, Gavin K. Brennen. 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.

Publications

  • 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
  • C. Dubey, D. Aggarwal. (2016). Improved hardness results for unique shortest vector problem. Inf. Proc. Lett 116 631-637
  • S. Lovett, D. Aggarwal, K. Hosseini. (2016). Affine-malleable extractors, spectrum doubling, and application to privacy amplification. IEEE ISIT