1. Banegas, G., Bernstein, D.J., van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 451–472 (2021)
2. Gidney, C.: Asymptotically efficient quantum Karatsuba multiplication. arXiv preprint arXiv:1904.07356 (2019)
3. Gouzien, É., Ruiz, D., Régent, F.M.L., Guillaud, J., Sangouard, N.: Computing 256-bit elliptic curve logarithm in 9 hours with 126133 cat qubits. arXiv preprint arXiv:2302.06639 (2023)
4. Gyongyosi, L., Imre, S.: Circuit depth reduction for gate-model quantum computers. Sci. Rep. 10(1), 11229 (2020)
5. Lecture Notes in Computer Science;T Häner,2020