4
submitted 3 days ago by cm0002@lemdro.id to c/crypto@infosec.pub

Claim being tested: the Q‑Day Prize submission in this repo demonstrates a quantum attack on ECDLP — specifically, key recovery on curves up to 17 bits using IBM Quantum hardware.

This branch applies a single surgical patch (−29 / +30 lines) to projecteleven.py. The patch replaces the IBM Quantum backend inside solve_ecdlp() with os.urandom. Everything else — circuit construction, the ripple‑carry oracle, the extraction pipeline, the d·G == Q verifier — runs byte‑for‑byte unchanged.

If the quantum computer were contributing measurable signal, this substitution should break the recoveries. It does not. The author's own CLI recovers every reported private key at statistically indistinguishable rates from the IBM hardware runs.

[...]

The 17‑bit result is the one awarded 1 BTC. /dev/urandom recovers it ~40% of runs on a laptop. The author ran it once on IBM ibm_fez and claimed a quantum result.

https://www.projecteleven.com/blog/project-eleven-awards-1-btc-q-day-prize-for-largest-quantum-attack-on-elliptic-curve-cryptography-to-date

top 2 comments
sorted by: hot top new old
[-] Natanael@slrpnk.net 1 points 2 days ago

Oops lol. Quantum computing records and "supremacy" results keeps getting replicated on classical computers.

[-] SmoothOperator@lemmy.world 1 points 2 days ago* (last edited 1 day ago)

You can freely ignore any quantum utility claims until around 2035 in my opinion.

this post was submitted on 06 Jul 2026
4 points (100.0% liked)

Cryptography @ Infosec.pub

637 readers
1 users here now

Questions, answers, discussions, and literature on the theory and practice of cryptography

Rules (longer version here)

##Related resources;

founded 3 years ago
MODERATORS