Skip to content
Quantum.world

The Signal

Researchers report faster attack on quantum-money scheme

A paper in Quantum describes a quantum-search attack on a quantum-money proposal based on class group actions on elliptic curves. The method reduces the cost of a direct point-counting approach but remains exponential, while the same mathematical ideas offer a more efficient serial-number check.

Researchers report faster attack on quantum-money scheme

A faster route to cryptanalysis

Five researchers have published a cryptanalysis of an isogeny-based quantum-money scheme, describing a faster attack and a more efficient verification method. The paper appeared in Quantum on November 10, 2026, and examines a proposal based on class group actions on elliptic curves.

Quantum money aims to use quantum mechanics to make banknotes difficult to counterfeit. Its central inspiration is the no-cloning theorem: an unknown quantum state cannot be perfectly copied. Designing banknotes that anyone can verify while keeping forgery computationally difficult remains a challenge.

Using points on elliptic curves

The scheme analyzed in the paper was proposed by Hart Montgomery and Shahed Sharif at Asiacrypt 2024. It encodes quantum banknotes as superpositions of elliptic curves, mathematical objects also widely used in cryptography.

The researchers focus on rational points on those curves and on closely related curves called quadratic twists. Their quantum-search attack replaces an expensive point-counting procedure with simpler arithmetic tests on selected points of the curves and their twists. The paper’s abstract describes the method as leveraging the efficiency of evaluating division polynomials using coordinates of rational points.

The paper reports a speedup of O(log4 p) compared with the brute-force attack. That result concerns the cost of the attack, not a demonstration that the scheme can be counterfeited in practice.

The attack remains exponential

The speedup does not make the attack practical at the parameters considered.

The authors write, “While the resulting attack still runs in exponential time, our method provides the first nontrivial algorithmic insight into their structural hardness.” The result is therefore presented as an analysis of why the scheme is difficult to attack, not as a successful forgery.

A verification improvement

The same mathematical approach also has an application to checking banknotes. The authors say that algebraic properties of rational points and quadratic twists yield a more efficient verification procedure. The popular summary specifies that this improvement applies to the serial-number check used when verifying a banknote.

The paper’s authors are Hyeonhak Kim, Donghoe Heo, Seokhie Hong, Sangjin Lee and Suhri Kim. It appears in volume 10 of Quantum as article 2263.

Source

  1. Quantum

Related stories

Explore

More articles