Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves

DOI10.1007/s11128-014-0851-6zbMath1311.81075arXiv1401.2437OpenAlexW2100626924MaRDI QIDQ2018146

Rainer Steinwandt, Parshuram Budhathoki

Publication date: 13 April 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.2437

zbMATH Keywords

discrete logarithm problemquantum circuitShor's algorithm

Mathematics Subject Classification ID

Quantum computation (81P68) Factorization; primality (11A51) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count

Uses Software

• EFD
• QCViewer
• Python

Cites Work

• A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A new addition formula for elliptic curves over GF(2/sup n/)
• Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves