Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2011, Article ID 437541, 25 pages
http://dx.doi.org/10.1155/2011/437541
Research Article

Computing the Characteristic Polynomials of a Class of Hyperelliptic Curves for Cryptographic Applications

1College of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China
2College of Engineering and Science, Clemson University, Clemson, SC 29631, USA
3School of Mathematical Sciences, Xiamen University, Xiamen 361005, China

Received 12 November 2010; Accepted 21 March 2011

Academic Editor: J. Rodellar

Copyright © 2011 Lin You et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. Koblitz, “Hyperelliptic cryptosystems,” Journal of Cryptology, vol. 1, no. 3, pp. 139–150, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. J. Pelzl, T. Wollinger, J. Guajardo, and C. Paar, Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves, vol. 2779 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 2003.
  3. A. Weil, “Numbers of solutions of equations in finite fields,” Bulletin of the American Mathematical Society, vol. 55, pp. 497–508, 1949. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. R. Hartshorne, Algebraic Geometry, vol. 52 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 1977.
  5. K. S. Kedlaya, “Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology,” Journal of the Ramanujan Mathematical Society, vol. 16, no. 4, pp. 323–338, 2001. View at Google Scholar · View at Zentralblatt MATH
  6. I. Duursma and K. Sakurai, “Efficient algorithms for the Jacobian variety of hyperelliptic curves y2=xpx+1 over a finite field of odd characteristic p,” in Proceedings of the International Conference on Coding Theory, Cryptography and Related Areas, pp. 73–89, Springer, Guanajuato, Mexico, 2000.
  7. J. H. Silverman, Advanced Topics in the Arithmetic of Elliptic Curves, vol. 151 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 1994.
  8. P. Lockhart, “On the discriminant of a hyperelliptic curve,” Transactions of the American Mathematical Society, vol. 342, no. 2, pp. 729–752, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. I. Duursma, “Class numbers for some hyperelliptic curves,” in Arithmetic, Geometry and Coding Theory, pp. 45–52, de Gruyter, Berlin, Germany, 1996. View at Google Scholar · View at Zentralblatt MATH
  10. S. Tafazolian, On supersingular curves over finite fields, Ph.D. thesis, Instituto Nacional de Matemática Pura e Aplicada, 2008.
  11. J. M. Pollard, “Carlo methods for index computation modp,” Mathematics of Computation, vol. 32, no. 143, pp. 918–924, 1978. View at Google Scholar · View at Zentralblatt MATH
  12. O. Schirokauer, D. Weber, and T. Denny, “Discrete logarithms: the effectiveness of the index calculus method,” in Algorithmic Number Theory, vol. 1122 of Lecture Notes in Computer Science, pp. 337–361, Springer, Berlin, Germany, 1996. View at Google Scholar · View at Zentralblatt MATH
  13. P. Gaudry, “An algorithm for solving the discrete log problem on hyperelliptic curves,” in Advances in Cryptology—Eurocrypt 2000, vol. 807 of Lecture Notes in Computer Science, pp. 19–34, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. P. Gaudry, E. Thomé, N. Thériault, and C. Diem, “A double large prime variation for small genus hyperelliptic index calculus,” Mathematics of Computation, vol. 76, no. 257, pp. 475–492, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. S. D. Galbraith, “Supersingular curves in cryptography,” in Advances in Cryptology—ASIACRYPT 2001, vol. 2248 of Lecture Notes in Computer Science, pp. 495–513, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. H. Stichtenoth, “Über die Automorphismengruppe eines algebraischen Funktionenkörpers von Primzahlcharakteristik. II. Ein spezieller Typ von Funktionenkörpern,” Archiv der Mathematik, vol. 24, pp. 615–631, 1973. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. D. Boneh, “A brief look at pairings based cryptography,” in Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS '07), pp. 19–26, IEEE Press, Los Alamitos, CA, USA, 2007. View at Publisher · View at Google Scholar