| Lattice Problems Beyond Polynomial Time D Aggarwal, H Bennett, Z Brakerski, A Golovnev, R Kumar, Z Li, S Peters, ... Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1516-1526, 2023 | 15 | 2023 |
| Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding D Aggarwal, Y Chen, R Kumar, Y Shen 38th International Symposium on Theoretical Aspects of Computer Science …, 2021 | 15 | 2021 |
| Cryptanalysis of 2 Round Keccak-384 R Kumar, N Mittal, S Singh International Conference on Cryptology in India, 120-133, 2018 | 14 | 2018 |
| Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms D Aggarwal, Y Chen, R Kumar, Z Li, N Stephens-Davidowitz Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 12 | 2021 |
| Cryptanalysis of 1-round KECCAK R Kumar, MS Rajasree, H AlKhzaimi Progress in Cryptology–AFRICACRYPT 2018: 10th International Conference on …, 2018 | 9 | 2018 |
| Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! D Aggarwal, R Kumar arXiv preprint arXiv:2211.04385, 2022 | 3 | 2022 |
| Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding D Aggarwal, Y Chen, R Kumar, Y Shen arXiv preprint arXiv:2002.07955, 2020 | 3 | 2020 |
| Covert Authentication from Lattices R Kumar, K Nguyen International Conference on Applied Cryptography and Network Security, 480-500, 2022 | 1 | 2022 |
| Hardness of Approximation of (Multi-) LCS over Small Alphabet A Bhangale, D Chakraborty, R Kumar arXiv preprint arXiv:2006.13449, 2020 | 1 | 2020 |
| Maximum Distance Sub-Lattice Problem SK Mehta, MS Rajasree, R Kumar arXiv preprint arXiv:1811.03019, 2018 | | 2018 |
Divesh AggarwalNUSVerified email at nus.edu.sg
