Constructing Scalar Multiplication via Elliptic Net of Rank Two

  • Authors

    • Norliana Muslim
    • Mohamad Rushdan Md. Said
    2018-12-13
    https://doi.org/10.14419/ijet.v7i4.34.26884
  • add, double, elliptic, non-linear, rank.

  • Abstract

    Elliptic nets are a powerful method for computing cryptographic pairings. The theory of rank one nets relies on the sequences of elliptic divisibility, sets of division polynomials, arithmetic upon Weierstrass curves, as well as double and double-add properties. However, the usage of rank two elliptic nets for computing scalar multiplications in Koblitz curves have yet to be reported. Hence, this study entailed investigations into the generation of point additions and duplication of elliptic net scalar multiplications from two given points on the Koblitz curve. Evidently, the new net had restricted initial values and different arithmetic properties. As such, these findings were a starting point for the generation of higher-ranked elliptic net scalar multiplications with curve transformations. Furthermore, using three distinct points on the Koblitz curves, similar methods can be applied on these curves.

     

     

  • References

    1. [1] Chandrasekharan, K. (1985). Elliptic functions. Springer-Verlag.

      [2] Kanayama, N., Liu, Y., Okamoto, E., Saito, K., Teruya, T., & Uchiyama, S. (2014). Implementation of an elliptic curve scalar multiplication method using division polynomials. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 97(1), 300–302.

      [3] Koblitz, N. (1991). CM curves with good cryptographic properties. Proceedings of the Annual International Cryptology Conference, pp. 279-287.

      [4] Lang, S. (1973). Elliptic functions. Addison-Wesley.

      [5] Muslim, N., & Said, M. R. (2018). Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence. Proceedings of the 6th International Cryptology and Information Security Conference, pp. 9–25.

      [6] Ogura, N., Kanayama, N., Uchiyama, S., & Okamoto, E. (2011). Cryptographic pairings based on elliptic nets. Proceedings of the International Workshop on Security, pp. 65-78.

      [7] Shipsey, R. (2000). Elliptic divisibility sequences. PhD thesis, University of London.

      [8] Silverman, J. H. (1986). The arithmetic of elliptic curve. Springer-Verlag.

      [9] Stange, K. E. (2008). Elliptic net and elliptic curve. PhD thesis, Brown University.

      [10] Stange, K. E (2007). Elliptic nets with applications to cryptography. https://www.microsoft.com/en-us/research/video/elliptic-nets-with-applications-to-cryptography/.

      [11] Ward, M. (1948). Memoir on elliptic divisibility sequences. American Journal of Mathematics, 70(1), 31–74.

      [12] Muslim, N., & Said, M. R. M. (2017). Elliptic net and its cryptographic application. AIP Conference Proceedings, 1905(1), 030025.

  • Downloads

  • How to Cite

    Muslim, N., & Rushdan Md. Said, M. (2018). Constructing Scalar Multiplication via Elliptic Net of Rank Two. International Journal of Engineering & Technology, 7(4.34), 403-406. https://doi.org/10.14419/ijet.v7i4.34.26884

    Received date: 2019-01-31

    Accepted date: 2019-01-31

    Published date: 2018-12-13