WEAKNESSES OF THE TATE PAIRING ON GENERALIZED HESSIAN CURVES

키워드

참고문헌 (23)

1. Christophe Arène, "Faster computation of the Tate pairing", Journal of Number Theory, 131(5), pp.842~857 (2011), Elsevier BV[DOI]
2. P. Barreto, "Efficient pairing computation on supersingular abelian varieties", Des. Codes Cryptogr., 42(3), pp.239~271 (2007)
3. D. Bernstein, "Twisted edwards curves", Progress in Cryptology-AFRICACRYPT 2008, pp.389~405 (2008)
4. D. Boneh, "Identity-Based Encryption from the Weil Pairing", Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pp.213~229 (2001), Springer
5. D. Boneh, "Collusion resistant brodadcast encryption with short ciphertexts and private keys, in CRYPTO 2005", LNCS, 3621, pp.258~275 (2005)
6. J. C. Choon, "An identity-Based Signature from Gap Diffie-Hellman Groups", LNCS, 2567, pp.18~30 (2002), Springer
7. D. V. Chudnovsky, "Sequences of numbers generated by addition in formal groups and new primality and factorization tests", Advances in Applied Mathematics, 7(4), pp.385~434 (1986)
8. M. Das, "Pairing computation on twisted edwards form elliptic curves", Pairing-Based Cryptography-Pairing 2008, pp.192~210 (2008)
9. I. M. Duursma, "Tate pairing implementation for hyperelliptic curves y2 = xp - x + d, In Advances in Cryptology - Asiacrypt 2003", Springer, 2260, pp.360~363 (2003), Springer
10. H. M. Edwards, "A normal form for elliptic curves", Bulletin of the American Mathematical Society, 44(3), pp.393~422 (2007)
11. R. Farashahi, "Efficient Efficient arithmetic on hessian curves", Public Key Cryptography-PKC 2010, pp.243~260 (2010)
12. H. Gu, "Efficient pairing computation on elliptic curves in hessian form", Information Security and Cryptology-ICISC 2010, pp.169~176 (2011)
13. O. Hesse, "Uber die Elimination der Variabeln aus drei algebraischen Gleichungen vom zweiten Grade mit zwei Variabeln", Journal fur die reine und angewandte Mathematik, 10, pp.68~96 (1844)
14. F. Hess, "Exponent group signature schemes and efficient identity based signature schemes based on pairing, SAC 2002", LNCS, 2595, pp.310~324 (2002)
15. S. Ionica, "Another approach to pairing computation in edwards coordinates", Progress in Cryptology-INDOCRYPT 2008, pp.400~413 (2008)
16. M. Joye, "Hessian elliptic curves and side-channel attacks", Cryptographic Hardware and Embedded Systems CHES 2001, pp.402~410 (2001), Springer
17. S. Kwon, "Efficient Tate pairing computation for super-singular elliptic curves over binary fields", LNCS, 3574, pp.134~145 (2005), Springer
18. L. Li, "Tate Pairing Computation on Generalized Hessian Curves, Information Security Applications", LNCS, 7690, pp.111~123 (2012)
19. N. E. Marbet, "What about Vulnerability to a Fault Attack of the Miller Algorithm During an Identity Based Protocol?", Proc. 3rd International Conf. and Workshops on Advances in Information Security and Assurance, pp.122~134 (2009)
20. V. S. Miller, "The Weil pairing, and its efficient calculation", Journal of Cryptology, 17(4), pp.235~261 (2004)
21. D. Page, "A Fault Attack on Pairing Based Cryptography", IEEE Trans. on Computers, 55(9), pp.1075~1080 (2006)
22. A. Shamir, "Identity-based cryptosystems and signature schems", Advances in Cryptology-CRYPTO'84, LNCS 196, pp.47~53 (1985), Springer
23. N. Smart, "The hessian form of an ellitpic curve", Cryptographic Hardware and Embedded Systems CHES 2001, pp.118~125 (2001), Springer

관련 논문AI추천