Tate pairing computation on the divisors of hyperelliptic curves of genus 2

키워드

참고문헌 (23)

1. P. S. L. M. Barreto, "C. O’hEigeartaigh, and M. Scott, Efficient pairing computation on supersingular abelian varieties", Designs codes and cryptography, 42(3), pp.239~271 (2007)
2. P. S. L. M. Barreto, "Efficient algorithms for pairingbased cryptosystems, Advances in cryptology—CRYPTO 2002", Lecture Notes in Computer Science, 2442, pp.354~368 (2002), Springer
3. P. S. L. M. Barreto, "On the selection of pairing-friendly groups, Selected areas in cryptography", Lecture Notes in Computer Science, 3006, pp.17~25 (2004), Springer
4. D. Boneh, "Identity-based encryption from the Weil pairing", SIAM Journal on Computing, 32(3), pp.586~615 (2003)
5. D. Boneh, "Short signatures from the Weil pairing, Advances in cryptology—ASIACRYPT 2001 (Gold Coast)", Lecture Notes in Computer Science, 2248, pp.514~532 (2001), Springer
6. L. Chen, "Identity Based Authenticated Key Agreement Protocols from Pairings", pp.184~ (2002), Cryptology eprint Archives
7. Y. Choie, "Implementation of Tate pairing on hyperelliptic curves of genus 2, Information security and cryptology—ICISC 2003", Lecture Notes in Computer Science, 2971, pp.97~111 (2004), Springer
8. I. Duursma, "Tate pairing implementation for hyperelliptic curves y2 = xp ¡ x + d, Advances in cryptology—ASIACRYPT 2003", Lecture Notes in Computer Science, 2894, pp.111~123 (2003), Springer
9. G. Frey, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves", Mathematics of Computation, 62(206), pp.865~874 (1994)
10. S. Galbraith, "Supersingular curves in cryptography, Advances in cryptology—ASIACRYPT 2001 (Gold Coast)", Lecture Notes in Computer Science, 2248, pp.495~513 (2001), Springer
11. S. Galbraith, "Implementing the Tate pairing, Algorithmic number theory (Sydney, 2002)", Lecture Notes in Computer Science, 2369, pp.324~337 (2002), Springer
12. R. Granger, "Ate pairing on hyperelliptic curves, Proceedings of Euro 2007", Lecture Notes in Computer Science, 4515, pp.430~447 (2007), Springer
13. M. Katagi, "Novel efficient implementations of hyperelliptic curve cryptosystems using degenerate divisors, In Information Security Applications-WISA’2004", Lecture Notes in Computer Science, 3325, pp.345~359 (2005), Springer
14. N. Koblitz, "Algebraic Aspects of Cryptography In: Algorithms and Computation in Mathematics" (1998), Springer-Verlag
15. N. Koblitz, "Pairing-based cryptography at high security levels, Cryptography and coding", Lecture Notes in Computer Science, 3796, pp.13~36 (2005), Springer
16. A. J. Menezes, "Reducing elliptic curve logarithms to logarithms in a finite field", IEEE Transactions on Information Theory, 39(5), pp.1639~1646 (1993)
17. D. Mumford, "Tata Lectures on Theta. II, Jacobian theta functions and differential equations In: Progress in Mathematics", pp.43~ (1984), Birkhauser Boston, Inc.
18. K. Rubin, "Using Abelian Varieties to Improve Pairing-Based Cryptography", Journal of Cryptology
19. M. Scott, "Compressed pairings, Advances in cryptology—CRYPTO 2004", Lecture Notes in Computer Science, 3152, pp.140~156 (2004), Springer
20. J. Silverman, "The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics", pp.106~ (1986), Springer-Verlag
21. E. R. Verheul, "Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, Advances in cryptology—EUROCRYPT 2001 (Innsbruck)", Lecture Notes in Computer Science, 2045, pp.195~210 (2001), Springer
22. C. K. Yap, "Fundamental Problems of Algorithmic Algebra" (2000), Oxford University Press
23. A.Weimerskirch, "Generic GF(2m) arithmetic in software and its application to ECC, Proceedings of ACISP 2003", Lecture Notes in Computer Science, 2727, pp.79~92 (2003), Springer

관련 논문AI추천