1. Al-Daoud, E., Mahmod, R., Rushdan, M., Kilicman, A.: A new addition formula for elliptic curves over GF $$(2^n)$$ ( 2 n ) . IEEE Trans. Comput. 51(8), 972–975 (2002)
2. Amento, B., Rötteler, M., Steinwandt, R.: Efficient quantum circuits for binary elliptic curve arithmetic: reducing $$T$$ T -gate complexity. Quantum Inf. Comput. 13, 631–644 (2013)
3. Amento, B., Rötteler, M., Steinwandt, R.: Quantum binary field inversion: improved circuit depth via choice of basis representation. Quantum Inf. Comput. 13, 116–134 (2013)
4. Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 32(6), 818–830 (2013). For a preprint version see [5]
5. Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. arXiv:1206.0758v3 , January (2013)