Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory 39(5), 1639–1646 (1993)
2. Frey, G., Rück, H.G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62(206), 865–874 (1994)
3. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security, Okinawa, Japan (2000)
4. Lecture Notes in Computer Science;A. Joux,2000
5. Lecture Notes in Computer Science;D. Boneh,2001
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Algorithms on Hyperelliptic Pairings Using Hyperelliptic Nets;Lecture Notes in Computer Science;2024
2. Computationally Efficient Pairing-Friendly Curves for a 128bit Security Level;2023 9th Annual International Conference on Network and Information Systems for Computers (ICNISC);2023-10-27
3. Effective Pairings in Isogeny-Based Cryptography;Progress in Cryptology – LATINCRYPT 2023;2023
4. Divisibility Sequences and Further Generalizations;CMS/CAIMS Books in Mathematics;2023
5. The elliptic net algorithm revisited;Journal of Cryptographic Engineering;2022-11-04