Scalar Multiplication via Elliptic Nets with Application to Cryptography

  • Authors

    • Norliana Muslim
    • Mohamad Rushdan Md Said
    https://doi.org/10.14419/ijet.v7i3.28.24685
  • divisibility, elliptic, polynomial, rank, scalar.

  • The net theory based on elliptic sequences is widely used as a computational tool in cryptographic pairing. The theory of this net is originated from non-linear recurrence relations which also known as elliptic divisibility sequences. In this study, at first we review the history of elliptic net such as recurrence sequences and elliptic divisibility sequences with the important properties. Next, we address scalar multiplication in elliptic curve cryptography. We further with division polynomials used in the elliptic net and followed by an elliptic net scalar multiplication. Finally, this study stated the future research directions of elliptic net and its scalar multiplication. The findings from this study will help other researchers to explore and to expand recent topics of applied mathematical sequences in cryptography.

     

  • References

    1. [1] K. Stange, “The Tate pairing via elliptic nets,†Lect. Notes Comput. Sci., 4575, 329–348, 2007.

      [2] A. J. Menezes, T. Okamoto, and S. A. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field,†IEEE Trans. Inf. Theory, 39(5), 1639–1646, 1993.

      [3] E. Lucas, “Theories des fonctions numeriques simplement periodiques,†Am. J. Math., 1(3), 197–240, 1878.

      [4] M. Smith, P., and Lennon, “LUC: A new public key system,†Proceedings of the Ninth International Conference on Information Security, pp. 103-117, 1993.

      [5] N. Muslim and M. R. Md. Said, “A New Cryptosystem Analogous to LUCELG and Cramer-Shoup,†Int. J. Cryptol. Res., 1(20, 191–204, 2009.

      [6] M. Somos, “Problem 1470,†1989., 1948.

      [7] M. Ward, “Memoir on elliptic divisibility sequences,†Am. J. Math., 70(1), 31–74.

      [8] R. Shipsey, “Elliptic divisibility sequences,†PhD thesis, University of London, 2000.

      [9] O. Bizim, “On the elliptic divisibility sequences over finite,†World Acad. Sci. Eng. Technol., 35, 1011–1015, 2009.

      [10] K. E. Stange, “Elliptic nets and elliptic curves,†Algebr. Number Theory, 2, 197–229, 2011.

      [11] V. S. Miller, “Short programs for functions on curves,†1986, http://pages.cs.wisc.edu/~cs812-1/miller86.pdf.

      [12] N. Ogura and N. Kanayama, “Cryptographic pairings based on elliptic nets,†Adv. Inf. Comput. Secur., 7038, 1–16, 2011.

      [13] B. Chen and C. Zhao, “An improvement of the elliptic net algorithm,†IEEE Trans. Comput., 65(9), 2903–2909, 2015.

      [14] B. Chen, C. Hu, and C. Zhao, “A note on scalar multiplication using division polynomials,†IET Inf. Secur., 11(4), 195–198, 2017.

      [15] J. H. Silverman, The arithmetic of elliptic curves. Springer Science and Business Media, 2009.

      [16] M. Ayad, “Periodicite (mod q) des suites elliptiques et points S-entiers sur les courbes elliptiques,†Ann. Ins. Fourier, 3(43), 585–618, 1993.

      [17] K. E. Lauter and K. E. Stange, “The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences,†Proceedings of the International Workshop on Selected Areas in Cryptography, 2008, pp. 309–327.

      [18] S. D. Galbraith, F. Hess, and F. Vercauteren, “Hyperelliptic pairings,†Proceedings of the International Conference on Pairing-Based Cryptography, 108–131, 2007.

      [19] D. Hankerson, V. Scott and A. Menezes, "Guide to elliptic curve cryptograph". Springer, 2004.

      [20] A. Joux, “A one round protocol for Tripartite Diffie-Hellmanâ€, Journal of Cryptology, 17(4), 263-276, 2004.

  • Downloads

  • How to Cite

    Muslim, N., & Rushdan Md Said, M. (2018). Scalar Multiplication via Elliptic Nets with Application to Cryptography. International Journal of Engineering & Technology, 7(3.28), 153-156. https://doi.org/10.14419/ijet.v7i3.28.24685