Follow
RAJENDRA KUMAR
RAJENDRA KUMAR
Verified email at weizmann.ac.il - Homepage
Title
Cited by
Cited by
Year
Cryptanalysis of 2 Round Keccak-384
R Kumar, N Mittal, S Singh
International Conference on Cryptology in India, 120-133, 2018
102018
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
82021
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
62021
Cryptanalysis of 1-round KECCAK
R Kumar, MS Rajasree, H AlKhzaimi
Progress in Cryptology–AFRICACRYPT 2018: 10th International Conference on …, 2018
62018
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
52023
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
32022
Covert Authentication from Lattices
R Kumar, K Nguyen
International Conference on Applied Cryptography and Network Security, 480-500, 2022
12022
Hardness of Approximation of (Multi-) LCS over Small Alphabet
A Bhangale, D Chakraborty, R Kumar
arXiv preprint arXiv:2006.13449, 2020
12020
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
12020
Maximum Distance Sub-Lattice Problem
SK Mehta, MS Rajasree, R Kumar
arXiv preprint arXiv:1811.03019, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–10