Abstract
We consider a quantum polynomial-time algorithm which solves the discrete logarithmproblem for points on elliptic curves over GF(2m). We improve over earlier algorithmsby constructing an efficient circuit for multiplying elements of binary finite fields andby representing elliptic curve points using a technique based on projective coordinates.The depth of our proposed implementation, executable in the Linear Nearest Neighbor(LNN) architecture, is O(m2), which is an improvement over the previous bound ofO(m3) derived assuming no architectural restrictions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have