Pairing Computation for Elliptic Curves with Embedding Degree 15
暂无分享,去创建一个
[1] H. Minkowski,et al. Geometrie der Zahlen , 1896 .
[2] W. André. Courbes algébriques et variétés abéliennes , 1971 .
[3] Alfred Menezes,et al. Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.
[4] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .
[5] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[6] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[7] Antoine Joux,et al. A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.
[8] Victor S. Miller,et al. The Weil Pairing, and Its Efficient Calculation , 2004, Journal of Cryptology.
[9] Shi Cui,et al. Special Polynomial Families for Generating More Suitable Elliptic Curves for Pairing-Based Cryptosystems , 2005, IACR Cryptol. ePrint Arch..
[10] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.
[11] Alfred Menezes,et al. Pairing-Based Cryptography at High Security Levels , 2005, IMACC.
[12] Frederik Vercauteren,et al. The Eta Pairing Revisited , 2006, IEEE Transactions on Information Theory.
[13] Nigel P. Smart,et al. High Security Pairing-Based Cryptography Revisited , 2006, ANTS.
[14] Eiji Okamoto,et al. Optimised Versions of the Ate and Twisted Ate Pairings , 2007, IMACC.
[15] Changan Zhao,et al. Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9 , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[16] Michael Scott,et al. A Taxonomy of Pairing-Friendly Elliptic Curves , 2010, Journal of Cryptology.
[17] Frederik Vercauteren,et al. Optimal Pairings , 2010, IEEE Transactions on Information Theory.