Improved scalar multiplication algorithm in affine coordinate system using elliptic net
In elliptic curve encryption, scalar multiplication (SM) is the most expensive and time-consuming operation. The elliptic curve cryptography attracts interest since it offers the same high security with a lower key length, owing to the advancement of modern technologies. Thus, this study designed a...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Philippine Statistical Association, Inc
2022
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/109522/ http://psasir.upm.edu.my/id/eprint/109522/1/1506-Article%20Text-2614-1-10-20230110.pdf |
| _version_ | 1848865393580441600 |
|---|---|
| author | Razali, Zuren Muslim, Norliana Kahar, Saliyah Yunos, Faridah Mohamed, Kamsiah |
| author_facet | Razali, Zuren Muslim, Norliana Kahar, Saliyah Yunos, Faridah Mohamed, Kamsiah |
| author_sort | Razali, Zuren |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In elliptic curve encryption, scalar multiplication (SM) is the most expensive and time-consuming operation. The elliptic curve cryptography attracts interest since it offers the same high security with a lower key length, owing to the advancement of modern technologies. Thus, this study designed a new scalar multiplication algorithm using six blocks of the elliptic net in a double and double-add method that cost 12M+6S in each block. This study also proposed a new formula for double block via the elliptic net method that saves four multiplications and four squaring from the prior double step. Experimental results over prime field p were conducted using safe curves namely numsp384t1 and numsp512t1, with equivalence sequences that satisfied gcd(p-1, 3). In the case of the 384-bits, results indicate that the developed scalar multiplication algorithm accelerates the running time by 65.96 % compared to the binary method, 44.81 % compared to the elliptic net without equivalent sequences, 30.28 % compared to the elliptic net with temporary variables, and 19.71 % compared to the seven blocks of the elliptic net with Karatsuba method. In a similar comparison for the 512-bits case, the proposed algorithm attained are 67.23 %, 44.65 %, 30.37 %, and 22.64 % faster, respectively. |
| first_indexed | 2025-11-15T14:04:00Z |
| format | Article |
| id | upm-109522 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T14:04:00Z |
| publishDate | 2022 |
| publisher | Philippine Statistical Association, Inc |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-1095222024-12-17T02:40:19Z http://psasir.upm.edu.my/id/eprint/109522/ Improved scalar multiplication algorithm in affine coordinate system using elliptic net Razali, Zuren Muslim, Norliana Kahar, Saliyah Yunos, Faridah Mohamed, Kamsiah In elliptic curve encryption, scalar multiplication (SM) is the most expensive and time-consuming operation. The elliptic curve cryptography attracts interest since it offers the same high security with a lower key length, owing to the advancement of modern technologies. Thus, this study designed a new scalar multiplication algorithm using six blocks of the elliptic net in a double and double-add method that cost 12M+6S in each block. This study also proposed a new formula for double block via the elliptic net method that saves four multiplications and four squaring from the prior double step. Experimental results over prime field p were conducted using safe curves namely numsp384t1 and numsp512t1, with equivalence sequences that satisfied gcd(p-1, 3). In the case of the 384-bits, results indicate that the developed scalar multiplication algorithm accelerates the running time by 65.96 % compared to the binary method, 44.81 % compared to the elliptic net without equivalent sequences, 30.28 % compared to the elliptic net with temporary variables, and 19.71 % compared to the seven blocks of the elliptic net with Karatsuba method. In a similar comparison for the 512-bits case, the proposed algorithm attained are 67.23 %, 44.65 %, 30.37 %, and 22.64 % faster, respectively. Philippine Statistical Association, Inc 2022-04-20 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/109522/1/1506-Article%20Text-2614-1-10-20230110.pdf Razali, Zuren and Muslim, Norliana and Kahar, Saliyah and Yunos, Faridah and Mohamed, Kamsiah (2022) Improved scalar multiplication algorithm in affine coordinate system using elliptic net. Mathematical Statistician and Engineering Applications, 71 (3). pp. 1775-1788. ISSN 2326-9865 https://www.philstat.org/index.php/MSEA/article/view/1506 |
| spellingShingle | Razali, Zuren Muslim, Norliana Kahar, Saliyah Yunos, Faridah Mohamed, Kamsiah Improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| title | Improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| title_full | Improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| title_fullStr | Improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| title_full_unstemmed | Improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| title_short | Improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| title_sort | improved scalar multiplication algorithm in affine coordinate system using elliptic net |
| url | http://psasir.upm.edu.my/id/eprint/109522/ http://psasir.upm.edu.my/id/eprint/109522/ http://psasir.upm.edu.my/id/eprint/109522/1/1506-Article%20Text-2614-1-10-20230110.pdf |