Shor’s quantum algorithm can solve the factorization problem and the elliptic curve discrete logarithm problem (ECDLP) in polynomial time. Due to the physical barrier for realizing large-scale reliable quantum computer, designs of concrete quantum circuits and their resource estimates have been actively discussed. In this paper, we focus on the case of the binary ECDLP. In particular, since the quantum resource for solving the binary ECDLP heavily depends on the quantum inversion algorithm over \(\mathbb F_{2^n}\) , we summarize the known quantum inversion algorithms and compare the quantum resource.