| 2024 | SYNASC | On the Maximum Distance Sublattice Problem and Closest Vector Problem. | Rajendra Kumar, Shashank K. Mehta, Mahesh Sreekumar Rajasree |
| 2023 | FOCS | Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! | Divesh Aggarwal, Rajendra Kumar |
| 2023 | STOC | Lattice Problems beyond Polynomial Time. | Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan |
| 2022 | ACNS | Covert Authentication from Lattices. | Rajendra Kumar, Khoa Nguyen |
| 2021 | SODA | Dimension-Preserving Reductions Between SVP and CVP in Different | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz |
| 2021 | STACS | Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen |
| 2018 | INDOCRYPT | Cryptanalysis of 2 Round Keccak-384. | Rajendra Kumar, Nikhil Mittal, Shashank Singh |
| 2018 | IECON | Modelling of Stray-Load Loss for Medium Power Induction Motors. | Rajendra Kumar, Praveen Kumar |
| 2012 | PST | Service provider authentication assurance. | Audun Jsang, Kent A. Varmedal, Christophe Rosenberger, Rajendra Kumar |
| 1983 | ICASSP | A fast algorithm for solving Toeplitz system of equations. | Rajendra Kumar |