.png){kind=icon}
.png){kind=icon}
Return
Implementing optimized pairings with elliptic nets
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-013-4840-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we use elliptic nets to implement the optimized Ate pairings and optimal pairings on the Barreto-Naehrig curves with embedding degree 12. In order to do the arithmetic of elliptic curves over finite fields with elliptic nets, we first give some basic properties of elliptic nets associated to elliptic curves over finite fields and the expression of Miller function in terms of elliptic nets. Then we give formulae to compute some optimized pairings with elliptic nets, which is a new method to implement pairings. This method with elliptic nets has time complexity comparable to Miller's algorithm and it can be optimized.
Keywords:
elliptic curves
elliptic nets
pairings
Miller's algorithm
pairing-based cryptography
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K