Rajendra Kumar

According to our database, Rajendra Kumar authored at least 16 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Fine-Grained Complexity via Quantum Natural Proofs.

Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman

CoRR, April, 2025

Lattice Based Crypto breaks in a Superposition of Spacetimes.

Divesh Aggarwal, Shashwat Agrawal, Rajendra Kumar

CoRR, March, 2025

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen

SIAM J. Comput., 2025

QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More.

Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman

Proceedings of the Approximation, 2025

2024

On the Maximum Distance Sublattice Problem and Closest Vector Problem.

Rajendra Kumar, Shashank K. Mehta, Mahesh Sreekumar Rajasree

Proceedings of the 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2024

2023

Lattice Problems beyond Polynomial Time.

Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!

Divesh Aggarwal, Rajendra Kumar

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

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

CoRR, 2022

Covert Authentication from Lattices.

Rajendra Kumar, Khoa Nguyen

Proceedings of the Applied Cryptography and Network Security, 2022

2021

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz

CoRR, 2021

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Dimension-Preserving Reductions Between SVP and CVP in Different <i>p</i>-Norms.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Hardness of Approximation of (Multi-)LCS over Small Alphabet.

Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar

Proceedings of the Approximation, 2020

2018

Maximum Distance Sub-Lattice Problem.

Shashank K. Mehta, Mahesh Sreekumar Rajasree, Rajendra Kumar

CoRR, 2018

Cryptanalysis of 2 Round Keccak-384.

Rajendra Kumar, Nikhil Mittal, Shashank Singh

Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

Cryptanalysis of 1-Round KECCAK.

Rajendra Kumar, Mahesh Sreekumar Rajasree, Hoda Alkhzaimi

Proceedings of the Progress in Cryptology - AFRICACRYPT 2018, 2018