Skip to content
Computing

Independent researcher breaks 15-bit elliptic curve key using public quantum hardware

Auto News

Computing Desk 5 min read

Image courtesy of coindesk_id

Independent researcher Giancarlo Lelli successfully compromised a 15-bit elliptic curve cryptographic key using cloud-accessible quantum hardware, securing a one-bitcoin bounty from quantum security firm Project Eleven. The April 2026 demonstration represents the largest public execution of a quantum attack targeting the mathematical foundations of modern decentralized networks, according to a report by CoinDesk.

The cryptographic breach expands upon a previous six-bit demonstration executed by Steve Tippeconnic in September 2025 utilizing an IBM 133-qubit quantum processor. Lelli achieved a factor-of-512 increase in computational complexity within a seven-month window, claiming a Q-Day Prize valued at approximately $78,000.

Elliptic curve cryptography operates as the primary security mechanism for digital asset ownership across distributed ledgers, allowing network participants to mathematically prove control over funds without exposing the underlying private key. A public key remains visible on the distributed ledger, while classical computing constraints render the reverse-engineering of the corresponding private key a computationally intractable problem.

The security of these systems relies entirely on the asymmetry of the mathematical operations involved in generating the key pairs. While multiplying a base point on an elliptic curve by a scalar value to produce a public key requires minimal computational energy, reversing the process to find the original scalar demands an impossibly vast search across the curve’s parameters.

Quantum processors executing Shor’s algorithm, a mathematical technique first proposed in 1994, bypass these classical limitations by directly resolving the discrete logarithm problems that secure digital signatures. While a 15-bit key contains a relatively trivial search space of 32,767 possibilities compared to modern standards, the experiment validates the transition of quantum cryptographic attacks from theoretical models to functional hardware deployments.

Classical computers approach this discrete logarithm problem through brute-force computation, testing possibilities sequentially until the correct scalar is identified. Quantum systems leverage quantum superposition and entanglement to evaluate multiple computational pathways simultaneously, identifying the global periodicity of the mathematical function to extract the private key efficiently.

Bitcoin currently relies on 256-bit elliptic curve security, placing current physical quantum capabilities far below the threshold required to threaten live network infrastructure. A bit functions as the smallest unit of information in a classical computer, while a qubit serves as the quantum computing equivalent, capable of representing complex states that exponentially accelerate specific mathematical operations.

The Project Eleven bounty parameter was specifically designed to measure the practical viability of executing these algorithms on commercially available quantum infrastructure. The successful extraction of the private key demonstrates that the foundational logic required to dismantle elliptic curve cryptography functions correctly when applied to physical quantum logic gates.

The achievement underscores a critical metric in the field of quantum cryptanalysis known as algorithmic scaling. By demonstrating that the quantum circuit depth required for a 15-bit break aligns with theoretical models, researchers can more accurately forecast the timeline for scaling the attack to the 256-bit threshold.

Theoretical resource estimates for executing a full 256-bit algorithmic break are compressing rapidly alongside hardware advancements. A recent publication from Google Research revised the estimated hardware requirement for a complete 256-bit cryptographic break to fewer than 500,000 physical qubits, a substantial reduction from previous projections that anticipated a need for millions of qubits.

This reduction in required physical qubits stems from optimizations in quantum error correction and more efficient implementations of Shor’s algorithm tailored for specific elliptic curves. As researchers refine the logical operations required to map the discrete logarithm problem onto quantum circuits, the hardware overhead necessary to maintain quantum coherence during the calculation decreases.

Project Eleven chief executive officer Alex Pruden noted the rapid progression of hardware capabilities and the decreasing friction for independent researchers entering the field.

“The resource requirements for this type of attack keep dropping, and the barrier to running it in practice is dropping with them,” Pruden said.

Pruden emphasized that the winning submission emerged from an independent researcher utilizing commercially available cloud quantum infrastructure, rather than a state-sponsored national laboratory or a proprietary quantum processor. This accessibility indicates that the tools required for quantum cryptanalysis are becoming democratized, accelerating the timeline for discovering novel optimizations in quantum circuit design.

The vulnerability profile is most acute for network addresses where the public key has already been exposed to the blockchain through previous transaction broadcasting. When a user spends bitcoin, the network requires the revelation of the public key to verify the cryptographic signature, permanently exposing that mathematical coordinate to public ledger observers.

Project Eleven researchers estimate that approximately 6.9 million bitcoin currently reside in addresses with exposed public keys, representing roughly one-third of the total circulating supply. This vulnerable capital includes an estimated one million tokens mined by pseudonymous creator Satoshi Nakamoto that have remained untouched since the network’s earliest operational years.

Any mature quantum computer capable of resolving 256-bit elliptic curve cryptography could systematically extract funds from these dormant wallets at leisure. Because the public keys are already known, a quantum adversary would not need to intercept a live transaction, but could instead compute the private keys offline and broadcast fraudulent transfers.

Addresses that have never initiated an outgoing transaction remain protected by an additional layer of cryptographic hashing, as their raw public keys have not yet been broadcast to the network. However, the moment a user initiates a transfer from a previously unexposed wallet, the public key becomes visible, creating a narrow window during which a sufficiently fast quantum processor could theoretically intercept and forge the transaction.

Protocol developers are accelerating post-quantum migration strategies to preempt the arrival of cryptographically relevant quantum computers. Bitcoin contributors have proposed the Bitcoin Improvement Proposal 360 (BIP-360), a framework designed to introduce quantum-safe address types utilizing hash-based cryptography that remains resistant to Shor’s algorithm.

Similar cryptographic transition frameworks are simultaneously advancing across the Ethereum, Tron, StarkWare, and Ripple networks. As physical qubit counts scale and algorithmic efficiency improves, the integration of post-quantum cryptography will transition from a theoretical research objective to an urgent operational necessity for the entire digital asset ecosystem.

Read More

More in Computing

View Section