Publisher
Springer Nature Switzerland
Reference24 articles.
1. Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv:quant-ph/0201067 (2002). (Also IBM Research Report RC 19642)
2. Lecture Notes in Computer Science;M Ekerå,2017
3. Ekerå, M.: On post-processing in the quantum algorithm for computing short discrete logarithms. Des. Codes Cryptogr. 88(11), 2313–2335 (2020)
4. Ekerå, M.: Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. J. Math. Cryptol. 15(1), 359–407 (2021)
5. Ekerå, M.: On completely factoring any integer efficiently in a single run of an order-finding algorithm. Quantum Inf. Proc. 20(205), 1–14 (2021)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献