Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2 n) (1306.1161v2)

Published 5 Jun 2013 in quant-ph, cs.DS, and cs.ET

Abstract: Improving over an earlier construction by Kaye and Zalka, Maslov et al. describe an implementation of Shor's algorithm which can solve the discrete logarithm problem on binary elliptic curves in quadratic depth O(n2). In this paper we show that discrete logarithms on such curves can be found with a quantum circuit of depth O(log2 n). As technical tools we introduce quantum circuits for GF(2n) multiplication in depth O(log n) and for GF(2n) inversion in depth O(log2 n).

Citations (9)

Summary

We haven't generated a summary for this paper yet.