Rajendra Kumar

24 papers A* 3A 2B 1Misc 2Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Attacks on Sparse LWE and Sparse LPN with new Sample-Time tradeoffs.
CoRR
Shashwat Agrawal, Amitabha Bagchi, Rajendra Kumar
2025 J jnl
Fine-Grained Complexity via Quantum Natural Proofs.
CoRR
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2025 J jnl
Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
SIAM J. Comput.
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
2025 J jnl
Lattice Based Crypto breaks in a Superposition of Spacetimes.
CoRR
Divesh Aggarwal, Shashwat Agrawal, Rajendra Kumar
2025 A conf
QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More.
APPROX/RANDOM
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2024 Misc conf
On the Maximum Distance Sublattice Problem and Closest Vector Problem.
SYNASC
Rajendra Kumar, Shashank K. Mehta, Mahesh Sreekumar Rajasree
2023 A* conf
Lattice Problems beyond Polynomial Time.
STOC
Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
2023 J jnl
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more.
CoRR
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2023 A* conf
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!
FOCS
Divesh Aggarwal, Rajendra Kumar
2022 B conf
Covert Authentication from Lattices.
ACNS
Rajendra Kumar, Khoa Nguyen
2022 J jnl
Covert Authentication from Lattices.
IACR Cryptol. ePrint Arch.
Rajendra Kumar, Khoa Nguyen
2022 J jnl
Lattice Problems Beyond Polynomial Time.
CoRR
Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
2022 J jnl
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem!
CoRR
Divesh Aggarwal, Rajendra Kumar
2021 A* conf
Dimension-Preserving Reductions Between SVP and CVP in Different
SODA
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz
2021 J jnl
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.
CoRR
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz
2021 A conf
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
STACS
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
2020 — conf
Hardness of Approximation of (Multi-)LCS over Small Alphabet.
APPROX-RANDOM
Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
2020 J jnl
Hardness of Approximation of (Multi-)LCS over Small Alphabet.
CoRR
Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
2020 J jnl
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
CoRR
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
2018 — conf
Cryptanalysis of 1-Round KECCAK.
AFRICACRYPT
Rajendra Kumar, Mahesh Sreekumar Rajasree, Hoda Alkhzaimi
2018 Misc conf
Cryptanalysis of 2 Round Keccak-384.
INDOCRYPT
Rajendra Kumar, Nikhil Mittal, Shashank Singh
2018 J jnl
Cryptanalysis of 2-round KECCAK-384.
IACR Cryptol. ePrint Arch.
Rajendra Kumar, Nikhil Mittal, Shashank Singh
2018 J jnl
Maximum Distance Sub-Lattice Problem.
CoRR
Shashank K. Mehta, Mahesh Sreekumar Rajasree, Rajendra Kumar
2017 J jnl
Cryptanalysis of 1-Round KECCAK.
IACR Cryptol. ePrint Arch.
Rajendra Kumar, Mahesh Sreekumar Rajasree, Hoda Alkhzaimi