Rajendra Kumar

Assistant Professor of Computer Science at IIT Delhi.
Lattices and Post-Quantum Cryptography.

[M_Vidyasagar @stellensatz]

Friends, the list of newly elected Fellows of The Royal Society for the year 2026 is *finally* public.

Prof. @agrawalmanindra is now Manindra Agrawal FRS.

Hearty congratulations to Manindra for this well-deserved recognition, to go along with so many others that he has had.👏👏

[CSE Department @ IIT Delhi @cseiitd]

📢 Applications are now open for the position of Institute Postdoctoral Fellow (IPDF) in all areas of Computer Science.

🗓 Deadline: 15 April, 5:30 PM IST

🔗 More details: https://t.co/698yo0LyAf

#Postdoc #ComputerScience #IITDelhi #ResearchCareers

[CSE Department @ IIT Delhi @cseiitd]

🎓 PhD Admissions — Winter Cycle
Interested in pursuing a Ph.D. in Computer Science at one of India’s top institutes @iitdelhi ?
📢 CSE, IIT Delhi invites passionate researchers to join our Ph.D. program!
Explore cutting-edge areas in AI, quantum computing, systems, security, theoretical CS, and trustworthy AI.

🗓️ Written test: Dec 3 | Interviews: Dec 4–5
🔗 Apply: https://t.co/CxEOKP841H
📘 Details: https://t.co/lybSNmhUlt

[CSE Department @ IIT Delhi @cseiitd]

Interested in learning about fundamental and cutting-edge research on data privacy?

Check out the summer school and workshop on "Computational Challenges in Data Privacy" at IIT Delhi from July 5-8, 2025.
https://t.co/yWwz32oD2E

Register by May 31st!
https://t.co/lYz4MhJ7OS

[CSE Department @ IIT Delhi @cseiitd]

Job Alert 📩
Interested in exploring post-quantum cryptography?
Join Prof. Rajendra Kumar (@Kumar__Rajendra) and Prof. Vireshwar Kumar (@kvireshwar)'s group!
Check out the detailed advertisement and apply soon!!
https://t.co/fdUFWJSoxC

[CSE Department @ IIT Delhi @cseiitd]

CSE IITD is now officially on X! 🎓 Follow us for updates on research, events, faculty achievements, and academic opportunities. Stay tuned for exciting insights from our department! #CSEIITD

[Karthik C. S. @karthikcs_]

Along with Amir Abboud and Nick Fischer, I'm organizing a tutorial in Fine-grained complexity in July 2024, primarily for graduate students. The website to apply is: https://t.co/H7CAWex2al.

[Huck Bennett @huckbennett]

I'm looking to hire one or two Ph.D. students for Fall '24 to work on problems related to lattices, error-correcting codes, and theoretical CS more broadly. If you're interested, please apply to Colorado *this fall*! Deadline: 12/15/2023, link: https://t.co/27aqcBsHhL 2/

[Hung Le @hunglvosu]

FOCS 23 list of accepted papers is online: https://t.co/J3aWTPG5vU

[Rajendra Kumar @Kumar__Rajendra]

Super excited to share that our paper on "Why we couldn't prove SETH hardness of the Closest Vector  Problem for even norms" has been accepted to FOCS'23. Joint work with @diveshaggarwal . Refer to @huckbennett 's tweet for an insightful description of this result.

[Huck Bennett @huckbennett]

@diveshaggarwal and @Kumar__Rajendra just posted a new paper that I'm very excited about: https://t.co/gk05Je9iRT. It addresses a problem that my coauthors and I spent 5 years working on without success: showing fine-grained hardness of SVP and CVP in the l_2 norm under SETH. 1/4

[Oded Rechavi @OdedRechavi]

When there are no questions at the end of your talk

[Rajendra Kumar @Kumar__Rajendra]

Excited to announce that I am on the academic job market this year. Please reach out with opportunities!

My research focuses on the foundations of Post-Quantum Cryptography. For more details, check out: https://t.co/112OF8VA7U

(RTs are appreciated)

[Rajendra Kumar @Kumar__Rajendra]

Really excited about our new paper on the Lattice Problems Beyond Polynomial Time. Check out this excellent thread by @NoahSD .

[Noah Stephens-Davidowitz @NoahSD]

Super excited about this new paper (with MANY awesome co-authors): Lattice Problems Beyond Polynomial Time https://t.co/a9jMgMGkKW .

We revisit four foundational results in the complexity of lattice problems and show how to generalize them, well, beyond polynomial time.

[TCS blog aggregator @cstheory]

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! https://t.co/dmkRLbZcsf

[Rajendra Kumar @Kumar__Rajendra]

@huckbennett @diveshaggarwal Thank you so much @huckbennett. Check out our paper on arXiv.

[National Institute of Standards and Technology @NIST]

As we prepare for the possible assault of a future quantum computer, NIST has chosen the first group of tools for our post-quantum cryptographic standard:

🔒 CRYSTALS-Kyber
🔒 CRYSTALS-Dilithium
🔒 FALCON
🔒 Sphincs+

Learn more: https://t.co/9dXynKmZLO

[ACM SIGACT @sigact]

Congratulations to
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan,
winners of the 2022 Gödel prize. https://t.co/hjHmgSaoxx

[Huck Bennett @huckbennett]

A thread on the Integer Programming Problem (IP), based on notes for my class: https://t.co/npcwBgUsCB.

Highlights of notes:
1. Slightly modified Lenstra's algorithm with improved runtime.
2. Kannan's algorithm, which is faster yet, and not in other lattice notes AFAIK. 1/

[The Nobel Prize @NobelPrize]

What is the meaning of life?

Hear 2021 chemistry laureate Benjamin List answer the question we all are trying to find an answer to.

#NobelPrize

[Arindam Ghosh @ArindamPhysics]

Delighted to announce the establishment of a Quantum Research Park at @iiscbangalore seed funded by the #Karnataka Innovation and Technology Society. This initiative will be a game changer in the Quantum-related research and entrepreneurial ecosystem in the state. @IIScQuanTech