default search action
Rajendra Kumar 0002
Person information
- affiliation: Indian Institute of Technology, Kanpur
- affiliation: National University of Singapore, Centre for Quantum Technologies, Singapore
Other persons with the same name
- Rajendra Kumar — disambiguation page
- Rajendra Kumar 0001
— Jamia Millia Islamia, Department of Computer Science, New Delhi, India
- Rajendra Kumar 0003
- Rajendra Kumar 0004
- Rajendra Kumar 0005 — Massachusetts Institute of Technology, Department of Urban Studies and Planning , Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]Divesh Aggarwal, Rajendra Kumar:
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! FOCS 2023: 2213-2230 - [c7]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - [i10]Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman:
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more. CoRR abs/2309.16431 (2023) - 2022
- [c6]Rajendra Kumar
Covert Authentication from Lattices. ACNS 2022: 480-500 - [i9]Divesh Aggarwal, Rajendra Kumar:
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! CoRR abs/2211.04385 (2022) - [i8]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems Beyond Polynomial Time. CoRR abs/2211.11693 (2022) - [i7]Rajendra Kumar, Khoa Nguyen:
Covert Authentication from Lattices. IACR Cryptol. ePrint Arch. 2022: 835 (2022) - 2021
- [c5]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. SODA 2021: 2444-2462 - [c4]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. STACS 2021: 4:1-4:20 - [i6]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz:
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. CoRR abs/2104.06576 (2021) - 2020
- [c3]Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar:
Hardness of Approximation of (Multi-)LCS over Small Alphabet. APPROX-RANDOM 2020: 38:1-38:16 - [i5]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. CoRR abs/2002.07955 (2020) - [i4]Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
Hardness of Approximation of (Multi-)LCS over Small Alphabet. CoRR abs/2006.13449 (2020)
2010 – 2019
- 2018
- [c2]Rajendra Kumar
Cryptanalysis of 1-Round KECCAK. AFRICACRYPT 2018: 124-137 - [c1]Rajendra Kumar
Cryptanalysis of 2 Round Keccak-384. INDOCRYPT 2018: 120-133 - [i3]Shashank K. Mehta, Mahesh Sreekumar Rajasree, Rajendra Kumar
Maximum Distance Sub-Lattice Problem. CoRR abs/1811.03019 (2018) - [i2]Rajendra Kumar, Nikhil Mittal, Shashank Singh:
Cryptanalysis of 2-round KECCAK-384. IACR Cryptol. ePrint Arch. 2018: 1191 (2018) - 2017
- [i1]Rajendra Kumar, Mahesh Sreekumar Rajasree, Hoda Alkhzaimi:
Cryptanalysis of 1-Round KECCAK. IACR Cryptol. ePrint Arch. 2017: 1028 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: