Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence
Elliptic Net is a powerful method to compute cryptographic pairings or scalar multiplication. The elliptic net rank one originated from the nonlinear recurrence relations, also known as the elliptic divisibility sequence. In this paper, a generalization of equivalent sequences is defined. Combining...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/66524/ http://psasir.upm.edu.my/id/eprint/66524/1/Cryptology2018-1.pdf |
| _version_ | 1848855594207805440 |
|---|---|
| author | Muslim, Norliana Md. Said, Mohamad Rushdan |
| author_facet | Muslim, Norliana Md. Said, Mohamad Rushdan |
| author_sort | Muslim, Norliana |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Elliptic Net is a powerful method to compute cryptographic pairings or scalar multiplication. The elliptic net rank one originated from the nonlinear recurrence relations, also known as the elliptic divisibility sequence. In this paper, a generalization of equivalent sequences is defined. Combining the new generalization with a few restrictions on the initial value, the paper further proposes and discusses an elliptic net scalar multiplication of rank one for Weistrass equation and non-singular elliptic curve. |
| first_indexed | 2025-11-15T11:28:14Z |
| format | Conference or Workshop Item |
| id | upm-66524 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:28:14Z |
| publishDate | 2018 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-665242019-03-03T23:55:37Z http://psasir.upm.edu.my/id/eprint/66524/ Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence Muslim, Norliana Md. Said, Mohamad Rushdan Elliptic Net is a powerful method to compute cryptographic pairings or scalar multiplication. The elliptic net rank one originated from the nonlinear recurrence relations, also known as the elliptic divisibility sequence. In this paper, a generalization of equivalent sequences is defined. Combining the new generalization with a few restrictions on the initial value, the paper further proposes and discusses an elliptic net scalar multiplication of rank one for Weistrass equation and non-singular elliptic curve. Institute for Mathematical Research, Universiti Putra Malaysia 2018 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/66524/1/Cryptology2018-1.pdf Muslim, Norliana and Md. Said, Mohamad Rushdan (2018) Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence. In: 6th International Cryptology and Information Security Conference 2018 (CRYPTOLOGY2018), 9-11 July 2018, Port Dickson, Negeri Sembilan, Malaysia. (pp. 19-25). |
| spellingShingle | Muslim, Norliana Md. Said, Mohamad Rushdan Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| title | Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| title_full | Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| title_fullStr | Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| title_full_unstemmed | Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| title_short | Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| title_sort | elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence |
| url | http://psasir.upm.edu.my/id/eprint/66524/ http://psasir.upm.edu.my/id/eprint/66524/1/Cryptology2018-1.pdf |