UPM Institutional Repository

Generalizing equivalent elliptic divisibility sequence for elliptic net scalar multiplication


Citation

Muslim, Norliana and Md. Said, Mohamad Rushdan (2018) Generalizing equivalent elliptic divisibility sequence for elliptic net scalar multiplication. International Journal of Cryptology Research, 8 (2). pp. 11-23. ISSN 0933-2790

Abstract

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.


Download File

[img] Text
Generalizing equivalent elliptic divisibility sequence for elliptic net scalar multiplication.pdf

Download (10kB)
Official URL or Download Paper: https://www.mscr.org.my/journal/journal-volume

Additional Metadata

Item Type: Article
Publisher: Malaysian Society for Cryptology Research
Keywords: Equivalence; Net; Divisible; Polynomials
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 13 Mar 2021 21:51
Last Modified: 13 Mar 2021 21:51
URI: http://psasir.upm.edu.my/id/eprint/72828
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item