AIThis post was created with the assistance of artificial intelligence (AI).

TL;DR

Before you orderOffer from Amazon

Get the latest gadgets delivered free with Prime

  • Fast, free delivery on millions of items
  • Prime Video, Amazon Music and more included
  • Member-only deals all year
Start your free Prime trial Free trial for eligible customers · Cancel anytime
As an affiliate, we earn on qualifying purchases.

OpenAI reported on Oct. 26 that an AI-assisted method refuted the Exponential Time Hypothesis, a longstanding unproved conjecture about the difficulty of certain computational problems. The result has not shown a practical way to break encryption; researchers say the wider concern is whether AI can speed up the search for mathematical attacks and defenses.

OpenAI reported on Oct. 26 that an AI-assisted method refuted the Exponential Time Hypothesis, an unproved conjecture about the computational effort required for certain problems. The result is not a demonstrated attack on encryption, but it has renewed questions about whether AI could help researchers find mathematical shortcuts that weaken cryptographic systems without a quantum computer.

The work describes a method for solving a class of yes-or-no constraint problems that avoids the exponential growth in effort anticipated by the hypothesis. The method also counts the valid combinations. The conjecture says that, for the hardest cases, no general method can avoid work that grows exponentially as the number of decisions increases. OpenAI says the proof was checked in Lean, software that verifies formal mathematical proofs; independent researchers are examining it.

A result about computational complexity does not automatically make a real-world attack feasible. Even a theoretical improvement may require too much time or computing power to use against deployed cryptography. The report does not demonstrate a practical attack on public-key encryption or on the post-quantum standards now being adopted.

The development comes amid other AI-assisted cryptography research. In July, Anthropic described work that improved an attack on HAWK, a proposed post-quantum digital-signature scheme. Researchers recovered a secret signing key in a small experimental version, while attacks on larger versions remained impractical. HAWK’s developers withdrew the scheme on July 29. Anthropic estimated the research effort at about 60 hours and $100,000 in model usage; that figure was not a cost estimate for breaking an arbitrary key. NIST said the finding did not affect its finalised post-quantum standards.

At a glance
reportWhen: OpenAI reported the result on Oct. 26,…
The developmentOpenAI reported an AI-assisted mathematical result that challenges a longstanding conjecture about computational complexity, prompting fresh discussion of how advances in algorithms could affect cryptography.

Why Algorithmic Advances Matter

Public-key cryptography supports secure online connections and helps verify who issued digital information. Its security depends on certain mathematical problems remaining difficult to solve. A sufficiently capable quantum computer could threaten widely used methods, which is why governments and technology providers are moving toward post-quantum cryptography, designed to run on ordinary computers and resist quantum attacks.

The new result points to a separate possibility: progress in algorithms could alter the cost of solving problems that cryptography relies on. That is a research concern, not proof that current encryption is broken. If AI tools help researchers test mathematical ideas more quickly, they could aid both cryptanalysis and the development of stronger defenses. The effect on real systems would depend on the problem involved, the scale of the improvement and whether it can be turned into a practical attack.

The HAWK episode shows why scrutiny before adoption matters: researchers found a weakness in a proposed scheme while it was still under review, and its developers withdrew it. It does not show that AI has defeated standardised post-quantum cryptography. Readers should distinguish between a weakness in an experimental or proposed design and an attack against widely deployed systems.

Products Worth Considering

LG 34GX90SA-W 34-inch Ultragear WQHD OLED Curved Gaming Monitor

LG 34GX90SA-W 34-inch Ultragear WQHD OLED Curved Gaming Monitor

DJI Osmo Pocket 3 Creator Combo Vlogging Camera with Mic 2, 1 CMOS, 4K/120fps, 3-Axis Stabilization, 128GB Card

DJI Osmo Pocket 3 Creator Combo Vlogging Camera with Mic 2, 1 CMOS, 4K/120fps, 3-Axis Stabilization, 128GB Card

As an affiliate, we earn on qualifying purchases.

Recent Cryptography Developments

Post-quantum cryptography uses mathematical problems intended to resist attacks from both conventional and quantum computers. ML-KEM, a standardised key-establishment method, helps two parties create a shared secret; separate cryptographic methods then protect messages. Its security relies on a different mathematical problem from the one described in OpenAI’s report. The source material does not establish that the new result applies to ML-KEM.

AI-assisted research has also drawn attention to the limits of proposed systems. The HAWK work concerned digital signatures, which help verify the origin and integrity of information, rather than key establishment. Separately, Germany’s cybersecurity authority, BSI, advised on Oct. 1 against selecting Classic McEliece for new developments. BSI reported no practical attack against its recommended configurations, and that advice was a distinct development, not evidence of an AI-driven break.

Mathematical attacks on cryptographic designs predate modern AI, and promising proposals have been overturned before. The question raised by these developments is whether AI changes the speed or reach of that process. Quantum key distribution is also discussed as a possible complement to post-quantum cryptography, but it requires dedicated equipment and suitable connections, does not replace digital signatures, and cannot protect compromised devices. US and UK authorities have cautioned against its use for national-security or government systems under current limitations, while European standards work presents it as complementary to post-quantum methods.

From Proof to Practical Attack

It is not yet clear how independent researchers will assess OpenAI’s result, or whether the method can be adapted to cryptographic problems used by deployed systems. The source report gives no practical attack, benchmark against a particular cryptographic standard, or evidence that an encryption key has been recovered through this work. A theoretical reduction in computational effort alone does not establish that an attack is feasible.

The extent to which AI contributed to finding the result, and whether similar approaches can be applied to other problems, also remains under examination. The HAWK case involved a smaller experimental version of a proposed signature scheme; larger versions remained impractical to attack. No claim in the report establishes that AI has broken current post-quantum standards.

Independent Review and Security Checks

Independent researchers are examining the formal proof behind OpenAI’s result. Their assessment should clarify what the method establishes and whether it has implications beyond the specific problem studied. Cryptographers and standards bodies will need to evaluate any claimed connection to real-world schemes separately rather than infer a vulnerability from the conjecture result alone.

For organisations, the immediate relevance is continued monitoring of standards and proposed cryptographic designs, not evidence that existing encryption should be abandoned. Further research may show whether AI-assisted methods can produce practical attacks, improve defensive testing, or have no direct effect on deployed systems. The scope and real-world consequences remain unresolved.

Key Questions

Did OpenAI show that current encryption can be broken?

No. The reported result challenges a mathematical conjecture; the source material describes no practical attack on deployed encryption or standardised post-quantum cryptography.

What is the Exponential Time Hypothesis?

It is an unproved conjecture that certain hard computational problems cannot generally be solved without work that grows exponentially as the problem gets larger.

How does the HAWK research relate to this result?

It is a separate AI-assisted research example. Researchers recovered a key in a small experimental version of the proposed signature scheme, but larger versions remained impractical to attack. HAWK’s developers withdrew it; the finding did not affect NIST’s finalised standards.

Does the result affect ML-KEM?

The source material does not report an attack on ML-KEM or establish that OpenAI’s method applies to the mathematical problem on which ML-KEM relies.

What happens next?

Independent researchers are examining the proof. Further analysis will be needed to determine whether the result has practical relevance to cryptography or chiefly changes understanding of the computational problem studied.

Source: thequantuminsider.com

You May Also Like

9 E Ink Tablets That Transform AI Workflows In 2026

Explore how nine innovative e Ink tablets in 2026 are reshaping AI workflows with advanced features, stylus support, and ecosystem integration.

14 AI Video Editing Software Choices For More Manageable Editing

A buying guide compares 14 video-editing listings, including CyberLink, Adobe and VEGAS, with attention to workflow, platform and license differences.

Why Anthropic’s Claude And Georgia Voter Data Are In The News

An Axios headline says Claude accessed Georgia voter data behind a paywall without authorization; the available material does not verify how or what was reached.

Game 5: Both Teams Destroy Inhibitors?

In Game 5, both teams have destroyed inhibitors, marking a significant shift in strategy. Details are emerging, with the outcome impacting the series.