It’s a matter of immense joy and pride that India has come 4th in its best-ever performance in the International Maths Olympiad. Our contingent has brought home 4 Golds and one Silver Medal. This feat will inspire several other youngsters and help make mathematics even more

India did pretty well too.

I’d like to see similar recognition of the US team’s performance from President Donald J. Trump but given the way mathematics is regarded in America, I don’t have much hope.

Time to have an open convention and get a more moderate candidate who can easily beat Donald J. Trump. Governor Gretchen Whitmer and Governor Josh Shapiro would be a great thing for America not held hostage between MAGA extremists and DEI extremism. Unique opportunity for a better moderate path.

↙️ FHE + iO AES ↘️

Happy Post-Quantum Cryptography Standardization Day!

Want to attend #FOCS2024 in Chicago this year? Travel grants are available for US-based students and postdocs! Apply by ⏰ Sep 13: focs.computer.org/2024/travel-su… Members of underrepresented groups encouraged to apply. Don't self-censor: also, you don't need a paper to be eligible!

John Watrous has a blog and everyone should read it. johnwatrous.com/blog/

Can you figure out what this equals? Ramanujan could -- and did!

I just discovered the Error Correcting Zoo: A very cool resource for Coding theory

In honor of the late Freddie Mercury's 78th bday, a programmer's ode to Queen: bit.ly/2buA9Mq

“A correction was made on Sept. 6, 2024: Because of an editing error, an earlier version of this article misidentified the heart’s location. It is not in the abdominal cavity.” 😂 nytimes.com/2024/09/06/hea…

MIT EECS is hiring a theory lecturer! Apply here: faculty-searches.mit.edu/eecs_lect4/reg…

Sounds like a super exciting opportunity! MIT EECS was such an invigorating environment, and I miss my days there. I've heard the soft deadline is October 15 (two weeks from now), but applications after may be considered. Can't miss for anyone searching for teaching positions!

Quantum pseudorandomness has a ton of potential: it helps us identify computational limitations that arise when examining properties of quantum mechanical systems, such as entanglement, thermalization and information scrambling.

It turns out that even a simple cloning game as this one is incredibly difficult to analyze. Are Haar cloning games, in some sense, the "hardest" cloning games in the sense that they admit no non-trivial winning strategies for recovering x?

In our paper, we show that this is indeed the case! We prove a worst-case to average-case reduction for a large class of cloning games. Our main technical contribution is to show that the Haar cloning game does not admit *any* non-trivial winning strategies.

There are no words 💔

An excellent step in the right direction: news.mit.edu/2024/mit-tuiti…

New and returning faces on The Cryptographers' Panel, a fan favorite #RSAC Keynote every year. Learn how the cryptographers see current events in cybersecurity and AI. spr.ly/60120yaPO April 29, 9:40 AM PT at RSAC 2025. Whitfield Diffie Ed Felten Raluca Ada Popa Vinod Vaikuntanathan