Optimal Ate Pairing on Elliptic Curves with Embedding Degree $9,15$ and $27$
Much attention has been given to the efficient computation of pairings on elliptic curves with even embedding degree since the advent of pairing-based cryptography. The few existing works in the case of odd embedding degrees require some improvements. This paper considers the computation of optimal...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Episciences
2020-04-01
|
| Series: | Groups, Complexity, Cryptology |
| Subjects: | |
| Online Access: | https://gcc.episciences.org/6167/pdf |