arXiv (All)
open access
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
The Elliptic Curve Discrete Logarithm Problem (ECDLP) is a fundamental problem in cryptography, and reducing the resource requirements of quantum algorithms for solving ECDLP is an important goal. In this work, we present a space-efficient quantum algorithm for solving the ECDLP over prime fields, a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition#370271
- Exclusive-or encoded algebraic structure for efficient quantum dynamics#635534
- Exclusive-or encoded algebraic structure for efficient quantum dynamics#633185
- Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform#665456
- Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform#663956
Record · ID 973273
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive