Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2015, Article ID 597849, 5 pages
http://dx.doi.org/10.1155/2015/597849
Research Article

Metrics on the Sets of Nonsupersingular Elliptic Curves in Simplified Weierstrass Form over Finite Fields of Characteristic Two

Interdisciplinary Graduate School of Science and Engineering, Shimane University, 1060 Nishikawatsu-cho, Matsue-shi, Shimane 690-8504, Japan

Received 25 August 2015; Accepted 19 November 2015

Academic Editor: Aloys Krieg

Copyright © 2015 Keisuke Hakuta. 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, “Elliptic curve cryptosystems,” Mathematics of Computation, vol. 48, no. 177, pp. 203–209, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  2. V. S. Miller, “Use of elliptic curves in cryptography,” in Advances in Cryptology—CRYPTO '85 Proceedings, vol. 218 of Lecture Notes in Computer Science, pp. 417–426, Springer, Berlin, Germany, 1986. View at Publisher · View at Google Scholar
  3. D. Boneh and M. Franklin, “Identity based encryption from the Weil pairing,” SIAM Journal on Computing, vol. 32, no. 3, pp. 586–615, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the Weil pairing,” Journal of Cryptology, vol. 17, no. 4, pp. 297–319, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. A. O. L. Atkin and F. Morain, “Elliptic curves and primality proving,” Mathematics of Computation, vol. 61, no. 203, pp. 29–68, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  6. S. Goldwasser and J. Kilian, “Primality testing using elliptic curves,” Journal of the ACM, vol. 46, no. 4, pp. 450–472, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. H. W. Lenstra Jr., “Factoring integers with elliptic curves,” Annals of Mathematics, vol. 126, no. 3, pp. 649–673, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  8. P. L. Montgomery, “Speeding the Pollard and elliptic curve methods of factorization,” Mathematics of Computation, vol. 48, no. 177, pp. 243–264, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. P. K. Mishra and K. C. Gupta, “A metric on the set of elliptic curves over Fp,” Applied Mathematics Letters, vol. 21, no. 12, pp. 1330–1332, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. F. Vetro, “Metrics on the set of elliptic curves over Fp,” International Journal of Contemporary Mathematical Sciences, vol. 1, no. 1, pp. 22–24, 2011. View at Google Scholar
  11. M. Joye and C. Tymen, “Protections against differential analysis for elliptic curve cryptography: an algebraic approach,” in Cryptographic Hardware and Embedded Systems—CHES 2001 Proceedings, vol. 2162 of Lecture Notes in Computer Science, pp. 377–390, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  12. A. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Boston, Mass, USA, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  13. J. H. Silverman, The Arithmetic of Elliptic Curves, vol. 106 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 2nd edition, 2009. View at Publisher · View at Google Scholar
  14. W. A. Sutherland, Introduction to Metric and Topological Spaces, Oxford University Press, 2nd edition, 2009. View at MathSciNet