Generalizing equivalent elliptic divisibility sequence for elliptic net scalar multiplication
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: | Article |
| Language: | English |
| Published: |
Malaysian Society for Cryptology Research
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/72828/ http://psasir.upm.edu.my/id/eprint/72828/1/Generalizing%20equivalent%20elliptic%20divisibility%20sequence%20for%20elliptic%20net%20scalar%20multiplication.pdf |
| Summary: | 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. |
|---|