Efficient Record-and-Replay Arithmetic for Quantum Elliptic-Curve Point Addition
quant-ph
Submitted: 2026-09-24
Updated: 2026-09-24
Code: https://github.com/Layr-Labs/ecdsafail-challenge
Project page: https://ecdsa.fail
Terminology
Sources
- A Simple Proof that Toffoli and Hadamard are Quantum Universal
- Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
- Windowed quantum arithmetic
- Optimized quantum implementation of elliptic curve arithmetic over binary fields
- Verifiable Quantum Advantage via Optimized DQI Circuits
- How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates
- A Vision for Auto Research with LLM Agents
- ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Quantum Circuit Optimization with AlphaTensor
- Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity