Cryptanalysis of 1-Round KECCAK. - Rajendra Kumar 002; Mahesh Sreekumar Rajasree; Hoda Alkhzaimi (IACR Cryptol. ePrint Arch., 2017)

Maximum Distance Sub-Lattice Problem. - Shashank K. Mehta; Mahesh Sreekumar Rajasree; Rajendra Kumar 002 (CoRR, 2018)

Cryptanalysis of 2-round KECCAK-384. - Rajendra Kumar 002; Nikhil Mittal; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2018)

Hardness of Approximation of (Multi-)LCS over Small Alphabet. - Amey Bhangale; Diptarka Chakraborty; Rajendra Kumar 002 (APPROX-RANDOM, 2020)

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Zeyong Li; Noah Stephens-Davidowitz (SODA, 2021)

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Yixin Shen 001 (STACS, 2021)

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Zeyong Li; Noah Stephens-Davidowitz (CoRR, 2021)

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! - Divesh Aggarwal; Rajendra Kumar 002 (CoRR, 2022)

Covert Authentication from Lattices. - Rajendra Kumar 002; Khoa Nguyen 002 (IACR Cryptol. ePrint Arch., 2022)

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! - Divesh Aggarwal; Rajendra Kumar 002 (FOCS, 2023)

Lattice Problems beyond Polynomial Time. - Divesh Aggarwal; Huck Bennett; Zvika Brakerski; Alexander Golovnev; Rajendra Kumar 002; Zeyong Li; Spencer Peters; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (STOC, 2023)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more. - Yanlin Chen; Yilei Chen; Rajendra Kumar 002; Subhasree Patro; Florian Speelman (CoRR, 2023)

On the Maximum Distance Sublattice Problem and Closest Vector Problem. - Rajendra Kumar 002; Shashank K. Mehta; Mahesh Sreekumar Rajasree (SYNASC, 2024)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Yixin Shen 001 (SIAM J. Comput., 2025)

Lattice Based Crypto breaks in a Superposition of Spacetimes. - Divesh Aggarwal; Shashwat Agrawal; Rajendra Kumar 002 (CoRR, 2025)

Fine-Grained Complexity via Quantum Natural Proofs. - Yanlin Chen; Yilei Chen; Rajendra Kumar 002; Subhasree Patro; Florian Speelman (CoRR, 2025)