Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. S. Arita, “Algorithms for computations in Jacobian group of C ab curve and their application to discrete-log-based public key cryptosystems,” Conference on The Mathematics of Public Key Cryptography, Toronto, 1999.
2. Lect Notes Comput Sci;S. Arita,2000
3. S. Arita, “Construction of Secure C ab Curves Using Modular Curves,” ANTS VI, pp.113–126, Leiden, 2000.
4. G. Frey and H.-G. Rück, “A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves”, Mathematics of Computation, 62 (1994), 865–874.
5. S. Galbraith and N. Smart, “A Cryptographic Application of Weil Descent,” HP Labs Tech. Report, HPL-1999-70.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Improvement of Twisted Ate Pairing Efficient for Multi-Pairing and Thread Computing;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2011
2. Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2009
3. Algebraic curves and cryptography;Finite Fields and Their Applications;2005-08
4. References;Many Rational Points;2003
5. The GHS Attack Revisited;Lecture Notes in Computer Science;2003