论文信息 - Powered Tate Pairing Computation

Powered Tate Pairing Computation

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.

Je Hong Park | Bo Gyeong Kang

[1] Frederik Vercauteren,et al. The Eta Pairing Revisited , 2006, IEEE Transactions on Information Theory.

[2] Paulo S. L. M. Barreto,et al. Efficient Implementation of Pairing-Based Cryptosystems , 2004, Journal of Cryptology.

[3] Eric R. Verheul,et al. Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems , 2001, Journal of Cryptology.

[4] Moon Sung Lee,et al. Efficient Delegation of Pairing Computation , 2005, IACR Cryptol. ePrint Arch..

[5] Paulo S. L. M. Barreto,et al. On the Selection of Pairing-Friendly Groups , 2003, Selected Areas in Cryptography.

[6] Iwan M. Duursma,et al. Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.

[7] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[8] Alfred Menezes,et al. Pairing-Based Cryptography at High Security Levels , 2005, IMACC.

[9] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[10] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..