Abstract
In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition, binary shift, multiplication, squaring, inversion, and division included in the point addition on binary elliptic curves. Based on the space-efficient quantum Karatsuba multiplication, the number of CNOTs in the circuits of inversion and division has been reduced with the help of the Steiner tree problem reduction. The optimized size of the CNOTs is related to the minimum degree of the connected graph.
Funder
National Natural Science Foundation of China
Subject
General Physics and Astronomy
Reference15 articles.
1. A key agreement protocol based on group actions;Çağman;Numer. Methods Partial. Differ. Equ.,2021
2. A key agreement protocol involving the Taylor polynomials of differentiable functions;Çagğman;Fundam. Contemp. Math. Sci.,2021
3. An application of interior and closure in general topology: A key agreement protocol;Polat;Turk. J. Sci.,2021
4. Optimizing a polynomial function on a quantum processor
5. Shor's discrete logarithm quantum algorithm for elliptic curves
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献