About

I am an assistant professor in Cornell's computer science department, and a member of the applied math field and the mathematics field. My research to date has focused primarily on the study of lattices. I am also interested more broadly in theoretical computer science, cryptography, and geometry.

I received my PhD from NYU, advised by Professors Oded Regev and Yevgeniy Dodis. Before coming to Cornell, I was a fellow at the Simons Institute in Berkeley, as part of the program Lattices: Algorithms, Complexity, and Cryptography, a postdoctoral researcher at MIT's computer science department, supervised by Vinod Vaikunthanathan, and a postdoc at Princeton’s computer science department and visiting researcher at the Institute for Advanced Study’s math department—both as part of the Simons Collaboration on Algorithms and Geometry.

My email is noahsd@gmail.com. My office is Gates 321.

Selected Talks

(A much more complete list of talks is available in my CV.)

• "A Reverse Minkowski Theorem." Simons Institute Lattices: Geometry, Algorithms, and Hardness, February 2020. (youtube)
• "Algorithms for Lattice Problems." Simons Institute Lattices: Algorithms, Complexity, and Cryptography Boot Camp, January 2020. (youtube)
• "Complexity of Lattice Problems." Simons Institute Lattices: Algorithms, Complexity, and Cryptography Boot Camp, January 2020. (youtube)
• "SETH-hardness of coding problems." FOCS, November 2019. (youtube)
• "Benefits and risks of post-quantum cryptography from lattices." Centre for Quantum Technologies colloquium, April 2019. (youtube)
• "A simple proof of a reverse Minkowski inequality." IAS Computer Science/Discrete Mathematics Seminar, April 2018. (youtube)
• "Quantitative Hardness of CVP." Princeton theory lunch, September 2017. (youtube)
• "A Reverse Minkowski Theorem." Invited by TCS+, March 2017. (youtube)
• "Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines." CRYPTO, 2016. (youtube)
• "Cryptographic Reverse Firewalls." NYU Cryptography Reading Group, February 2016. (slides)
• "Solving SVP in 2^n Time Using Discrete Gaussian Sampling." Invited by Simons Institute Cryptography Program, July 2015. (youtube)
• "How to Eat Your Entropy and Have It Too—Optimal Recovery Strategies for Compromised RNGs." CRYPTO, 2014. (youtube)
• "The Halting Problem, Incompleteness, and the Limits of Mathematics." cSplash (a lecture series for high school students), April 2014. (youtube)
• "The FM-Index." Invited by Seven Bridges Genomics, January 2014. (youtube)
• "What Makes Poker Awesome (and Deep)?" Invited by NYU Game Center, March 2013. (youtube)

Other

• Lecture notes for my undergraduate course on cryptography (Cornell CS 4830).
• Lecture notes for my Fall 2016 mini course on lattices. (You might also want to look at Oded’s lecture notes.)
• Lecture notes on Ring-SIS and Ring-LWE for Vinod’s Fall 2018 LWE class.
• Program committees: Africacrypt 2018, Crypto 2018, Approx 2018, C2SI 2019, Africacrypt 2019, TCC 2019, Africacrypt 2020, ICALP 2021, CRYPTO 2022, TCC 2022, FOCS 2023, SOSA 2024, ITC 2024.
• Videos for the online seminars from the Simons Institute 2020 lattices program are available here. Together with the videos from that program's workshops (the boot camp on lattice algorithms, complexity, and cryptography, lattice geometry, algorithms and hardness, new cryptographic capabilities, and from theory to practice), these are an excellent resource for people wishing to learn about lattices and/or lattice-based cryptography. The bootcamp in particular is wonderful for this.