AI May Threaten Widely Used Cryptography Within Two Years, Scott Aaronson Warns
Former OpenAI safety researcher and quantum computing scholar Scott Aaronson discusses AI's growing ability to solve hard mathematical problems. He notes that OpenAI has publicized nearly 400 AI-solved results in mathematics and theoretical computer science, but none in cryptography, which he attributes to a deliberately cautious approach. Aaronson argues it is plausible that AI models could break one or more widely used encryption algorithms within one to two years, a disclosure that would need to reach the entire world rather than a single company. The interview also highlights how AI-generated proofs, such as one resolving the Unique Games Conjecture, are difficult for humans to read, and how companies like OpenAI and Anthropic are taking different approaches to publishing and explaining such results. Aaronson concludes that the central challenge is preserving human mathematical understanding and academic communities in an era where anyone can query AI for answers to open problems.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)
Log in to join the discussion and vote.
Log in