Key length estimation of pairing-based cryptosystems using η T pairing

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

Volumn 7232 LNCS, Issue , 2012, Pages 228-244

  Shinohara, Naoyuki ^a   Shimoyama, Takeshi ^b   Hayashi, Takuya ^c   Takagi, Tsuyoshi ^c  

^a NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^b FUJITSU LABORATORIES LTD   (Japan)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

discrete logarithm problem; finite field; key length; pairing based cryptosystems; suitable values

Indexed keywords

DISCRETE LOGARITHM PROBLEMS; FINITE FIELDS; KEY LENGTH; PAIRING BASED CRYPTOSYSTEMS; SUITABLE VALUES;

ALGORITHMS; ESTIMATION; FINITE ELEMENT METHOD; SECURITY OF DATA; SECURITY SYSTEMS;

CRYPTOGRAPHY;

EID: 84859448043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29101-2_16     Document Type: Conference Paper

References (31)

1. Adleman, L.M.: The Function Field Sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 108-121. Springer, Heidelberg (1994)
2. Aoki, K., Shimoyama, T., Ueda, H.: Experiments on the Linear Algebra Step in the Number Field Sieve. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC2007. LNCS, vol. 4752, pp. 58-73. Springer, Heidelberg (2007)
3. Adleman, L.M., Huang, M.-D.A.: Function field sieve method for discrete logarithms over finite fields. Inform. and Comput. 151, 5-16 (1999)
4. Ahmadi, O., Hankerson, D., Menezes, A.: Software Implementation of Arithmetic in F3m. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 85-102. Springer, Heidelberg (2007)
5. Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management - Part 1: General (Revised). NIST Special Publication 800-57 (2007)
6. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing- Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-368. Springer, Heidelberg (2002)
7. Barreto, P.S.L.M., Galbraith, S., ÓhÉigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des., Codes Cryptogr. 42(3), 239-271 (2007)
8. Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the çT pairing in characteristic three. IEEE Trans. Comput. 57(11), 1454-1468 (2008)
9. Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586-615 (2003)
10. Cavallar, S.: Strategies in Filtering in the Number Field Sieve. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 209-231. Springer, Heidelberg (2000)
11. Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324-337. Springer, Heidelberg (2002)
12. Gorla, E., Puttmann, C., Shokrollahi, J.: Explicit Formulas for Efficient Multiplication in F36m. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 173-183. Springer, Heidelberg (2007) (Pubitemid 351153085)
13. Granger, R.: Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 190-206. Springer, Heidelberg (2003)
14. Granger, R., Holt, A.J., Page, D., Smart, N.P., Vercauteren, F.: Function Field Sieve in Characteristic Three. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 223-234. Springer, Heidelberg (2004)
15. Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing-based cryptography in characteristic three. IEEE Trans. Comput. 54(7), 852-860 (2005)
16. Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Identity-Based Cryptography, pp. 188-206 (2009)
17. Harrison, K., Page, D., Smart, N.P.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics 5, 181-193 (2002)
18. Hayashi, T., Shinohara, N., Wang, L., Matsuo, S., Shirase, M., Takagi, T.: Solving a 676-Bit Discrete Logarithm Problem in GF(36n) . In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 351-367. Springer, Heidelberg (2010)
19. Joux, A., et al.: Discrete logarithms in GF(2607) and GF(2613). Posting to the Number Theory List (2005), http://listserv.nodak.edu/cgi-bin/wa.exe?A2= ind0509&L=nmbrthry&T=0&P=3690
20. Joux, A., Lercier, R.: The Function Field Sieve Is Quite Special. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 431-445. Springer, Heidelberg (2002)
21. Joux, A., Lercier, R.: The Function Field Sieve in the Medium Prime Case. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 254-270. Springer, Heidelberg (2006) (Pubitemid 44072244)
22. Kawahara, Y., Aoki, K., Takagi, T.: Faster Implementation of çT Pairing Over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 282-296. Springer, Heidelberg (2008)
23. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thomé, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-Bit RSA Modulus. In: Rabin, T. (ed.) CRYPTO2010. LNCS, vol. 6223, pp. 333-350. Springer, Heidelberg (2010)
24. Kerins, T., Marnane, W., Popovici, E., Barreto, P.S.L.M.: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 412-426. Springer, Heidelberg (2005) (Pubitemid 41520721)
25. Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bureau of Standards 49(1), 33-53 (1952)
26. Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. LNIM, vol. 1554, pp. 43-49 (1993)
27. Pollard, J.M.: The lattice sieve. LNIM, vol. 1554, pp. 43-49 (1993)
28. Page, D., Smart, N.P.: Hardware Implementation of Finite Fields of Characteristic Three. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 529-539. Springer, Heidelberg (2003)
29. Pomerance, C., Wagstaff Jr., S.S.: Implementation of the continued fraction integer factoring algorithm. Congress Numer. 37, 99-118 (1983)
30. Shinohara, N., Shimoyama, T., Hayashi, T., Takagi, T.: Key Length Estimation of Pairing-based Cryptosystems using ηT Pairing, Cryptology ePrint Archive: Report 2012/042 (2012), http://eprint.iacr.org/2012/042
31. Smart, N., Page, D., Vercauteren, F.: A comparison of MNT curves and supersingular curves. Applicable Algebra in Engineering, Communication and Computing 17, 379-392 (2006)