Subject
Applied Mathematics,General Engineering,Algebra and Number Theory,Theoretical Computer Science
Reference50 articles.
1. S. Arita, Algorithms for computations in jacobian group of Cab curve and their application to discret-log-based public key cryptosystems, in: The Mathematics of Public Key Cryptography, Fields Institute, Toronto, 1999, pp. 1291–1299.
2. A. Basiri, A. Enge, J.C. Faugère, N. Gürel, Implementing the arithmetic of C3,4 curves, in: Algorithmic Number Theory Seminar ANTS-VI, Lecture Notes in Computer Science, vol. 3076, Springer, Berlin, 2004, pp. 87–101.
3. D. Boneh, R. Venkatesan, Hardness of computing the most significant bits of secret keys in Diffie–Hellman and related schemes, in: Advances in Cryptology—Crypto '96, Lecture Notes in Computer Science, vol. 1109, Springer, Berlin, 1996, pp. 129–142.
4. Computing in the Jacobian of a hyperelliptic curve;Cantor;Math. Comp.,1987
5. Y. Choie, J.W. Lee, Speeding up the scalar multiplication in the Jacobian of hyperelliptic curves using Frobenius map, in: Progress in Cryptology—Indocrypt 2002, Lecture Notes in Computer Science, vol. 2551, Springer, Berlin, 2002, pp. 285–295.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献