Research and Development on Efficient Pairing Computations: Research and Development on Efficient Pairing Computations

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

[2]  Frederik Vercauteren,et al.  Aspects of Pairing Inversion , 2008, IEEE Transactions on Information Theory.

[3]  Jiwu Huang,et al.  Efficient Tate pairing computation using double-base chains , 2008, Science in China Series F: Information Sciences.

[4]  Hyang-Sook Lee,et al.  Efficient and Generalized Pairing Computation on Abelian Varieties , 2009, IEEE Transactions on Information Theory.

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

[6]  Steven D. Galbraith,et al.  Computing pairings using x-coordinates only , 2009, Des. Codes Cryptogr..

[7]  Steven D. Galbraith,et al.  Simplified pairing computation and security implications , 2007, J. Math. Cryptol..

[8]  Jiwu Huang,et al.  All Pairings Are in a Group , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[9]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1993, IEEE Trans. Inf. Theory.

[10]  Hideki Imai,et al.  Efficient Algorithms for Tate Pairing , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Jiwu Huang,et al.  A note on the Ate pairing , 2008, International Journal of Information Security.

[12]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .