Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence

Citation

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).

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

Text
Cryptology2018-1.pdf
Restricted to Repository staff only
Download (341kB)

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Institute for Mathematical Research
Publisher:	Institute for Mathematical Research, Universiti Putra Malaysia
Keywords:	Equivalence; Net; Divisible; Polynomials
Depositing User:	Nabilah Mustapa
Date Deposited:	03 Mar 2019 23:55
Last Modified:	03 Mar 2019 23:55
URI:	http://psasir.upm.edu.my/id/eprint/66524
Statistic Details:	View Download Statistic

Actions (login required)

View Item