Publisher
Springer Nature Switzerland
Reference18 articles.
1. Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 203–209 (1987)
2. Lecture Notes in Computer Science;VS Miller,1986
3. Gashkov, S.B., Sergeev, I.S.: Complexity of computation in finite fields. J. Math. Sci. 191, 661–685 (2013). https://doi.org/10.1007/s10958-013-1350-5
4. Paulo, S.B., Voloch, J.F.: Efficient Computation of Roots in Finite Fields. Kluwer Academic Publishers, Amsterdam (2004)
5. Khabbazian, M., Gulliver, T., Bhargava, V.: Double point compression with applications to speeding up random point multiplication. IEEE Trans. Comput. 56(3), 305–313 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Compression points in elliptic Montgomery and Edwards curves;Proceedings of the 7th International Conference on Networking, Intelligent Systems and Security;2024-04-18