Remarks on Cheon's algorithms for pairing-related problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4575 LNCS, Issue , 2007, Pages 302-316

  Kozaki, Shunji ^a   Kutsuma, Taketeru ^a   Matsuo, Kazuto ^a,b  

^a INSTITUTE OF INFORMATION SECURITY   (Japan)

^b CHUO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS;

ABELIAN GROUPS; DIFFIE-HELLMAN PROBLEM; INTERNATIONAL CONFERENCES; PAIRING-BASED CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 50049109567     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73489-5_17     Document Type: Conference Paper

References (35)

1. Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)
2. Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.): EUROCRYPT 2004. LNCS, vol. 3027, pp. 56-73. Springer, Heidelberg (2004)
3. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. Cryptology ePrint Archive, Report 2005/015, IACR, 2005. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440-456. Springer, Heidelberg (2005)
4. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001, LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
5. Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptology 17, 321-334 (2004)
6. On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.): SAC 2003. LNCS, vol. 3006, pp. 17-25. Springer, Heidelberg (2004)
7. [Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2006)
8. Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Design, Codes and Cryptography 37, 133-141 (2005)
9. Cheon, J.H.: Security analysis of strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1-11. Springer, Heidelberg (2006)
10. Comuta, A., Kawazoe, M., Takahashi, T.: How to construct pairing-friendly curves for the embedding degree k = 2n, n is an odd prime Cryptology ePrint Archive, Report 2006/427, IACR (2006)
11. Duquesne, S., Lange, T.: Pairing-based cryptography. In: Cohen, H., Frey, G., Doche, C. (eds.) Handbook of elliptic and hyperelliptic curve cryptography, pp. 573-590. Chapman & Hall/CRC, Sydney (2005)
12. Frey, G., Rück, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62, 865-874 (1994)
13. Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory. LNCS, vol. 4076, pp. 452-465. Springer, Heidelberg (2006)
14. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves, Cryptology ePrint Archive, Report 2006/372, IACR (2006)
15. Galbraith, S.D.: Pairings, Advances in Elliptic Curves Cryptography. In: Blake, I., Seroussi, G., Smart, N. (eds.) LMS 317, Cambridge U. P, pp. 183-213 (2005)
16. Gentry, C.: Practical identity-based encription without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 445-464. Springer, Heidelberg (2006)
17. Galbraith, S.D., McKee, J., Valença, P.: Ordinary abelian varieties having small embedding degree. In: Finite Fields and Their Applications (to appear, 2007)
18. Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers, 5th edn. Oxford U. P., Oxford (1979)
19. Joux, A.: One round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol. 1838, pp. 385-393. Springer, Heidelberg (2000)
20. Kutsuma, T., Matsuo, K.: Remarks on Cheon's algorithms for pairing-related problems. In: Proc. of SCIS2007, no. 4A1-2, IEICE (2007)
21. Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals E84-A(5), 1234-1243 (2001)
22. Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite fields. In: Proc. of STOC, pp. 80-89 (1991)
23. Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundamentals E85-A(2), 481-484 (2002)
24. Okamoto, T.: Efficient blind and partially blind signatures without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 80-99. Springer, Heidelberg (2006)
25. Ohgishi, K., Sakai, R., Kasahara, M.: Notes on ID-based key sharing systems over elliptic curve (in Japanese). Tech. Report ISEC99-57, IEICE (1999)
26. Paterson, K.G.: Cryptography from pairings. In: Blake, I., Seroussi, G., Smart, N. (eds.) Advances in Elliptic Curves Cryptography. LMS 317, pp. 215-251, Cambridge U. P., Cambridge (2005)
27. Pohlig, G.G., Hellman, M.E.: An improved algorithm for comuting logarithms over GF (p) and its cryptographic significance. IEEE Trans. on Info. Theory IT- 24, 106-110 (1978)
28. Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32, 918-924 (1978)
29. Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search. New results and applications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 408-413. Springer, Heidelberg (1990)
30. Scott, M., Barreto, P.S.L.M.: Generating more MNT elliptic curves. Designs, Codes and Cryptography 38, 209-217 (2006)
31. Shanks, D.: Class number, a theory of factrization, and genera, In: Proc. of Symp. Math. Soc., vol. 20, pp. 415-440 (1971)
32. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256-266. Springer, Heidelberg (1997)
33. Teske, E.: Speeding up pollard's rho method for computing discrete logarithms. In: Buhler, J.P. (ed.) Algorithmic Number Theory. LNCS, vol. 1423, pp. 541-553. Springer, Heidelberg (1998)
34. Square-root algorithms for the discrete logarithm problem (A survey), Public-Key Cryptography and Computational Number Theory, pp. 283-301, Walter de Gruyter, Berlin-New York ( 2001)
35. Wei, V.K.: Tight reductions among strong Diffie-Hellman assumptions, Cryptology ePrint Archive, Report 2005/057, IACR (2005)