Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Pairing-Based cryptography at high security levels
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this letter, we provide a simple proof of bilinearity for the eta pairing. Based on it, we show an efficient method to compute the powered Tate pairing as well. Although efficiency of our method is equivalent to that of the Tate pairing on the eta pairing approach, but ours is more general in principle.