Subtitle: Public-key encryption keeps your messaging and web browsing private, but it depends on shaky math assumptions. AI-powered math might break it.
Govind Pimpale, Research Fellow at the Foundation for American Innovation — September 9, 2026
Over the past few months, AI models have started resolving major mathematical problems, including ones that have withstood decades of human effort. Claude Fable disproved the Jacobian conjecture in three dimensions, and OpenAI announced a list of 10 problems that its Astra model solved or made significant progress on. Even more recently, an unreleased OpenAI model solved the Navier-Stokes Millennium Prize Problem, one of the most famous open problems in mathematics.
These are tremendous accomplishments, but very little about our day-to-day life will actually change as a result. This is because most well-known open mathematical questions are relatively insulated from practical applications. However, there are a few open mathematical problems that do have serious real-world implications. Chief among these is whether public-key encryption is fundamentally secure: that is, whether two strangers can share a secret message over public channels, such as the internet, without eavesdroppers having an efficient way to decipher it.
We rely on public-key encryption every day for end-to-end encrypted [...]
---
Outline:
(03:10) A Brief History of Public-Key Encryption
(07:18) Cryptomania or Minicrypt?
(11:20) AI and Cryptanalysis
(14:39) Living in Minicrypt
(19:33) Takeaways and Mitigations
---
First published:
September 9th, 2026
Source:
https://newsletter.ai-frontiers.org/p/ai-could-end-encryption-as-we-know
---
Narrated by TYPE III AUDIO.
---
Images from the article:



Apple Podcasts and Spotify do not show images in the episode description. Try Pocket Casts, or another podcast app.