{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:30Z","timestamp":1740099030838,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319785554"},{"type":"electronic","value":"9783319785561"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78556-1_13","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T16:59:59Z","timestamp":1521565199000},"page":"231-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Solving 114-Bit ECDLP for\u00a0a\u00a0Barreto-Naehrig Curve"],"prefix":"10.1007","author":[{"given":"Takuya","family":"Kusaka","sequence":"first","affiliation":[]},{"given":"Sho","family":"Joichi","sequence":"additional","affiliation":[]},{"given":"Ken","family":"Ikuta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7330-138X","authenticated-orcid":false,"given":"Md. Al-Amin","family":"Khandaker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6247-0719","authenticated-orcid":false,"given":"Yasuyuki","family":"Nogami","sequence":"additional","affiliation":[]},{"given":"Satoshi","family":"Uehara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2651-2701","authenticated-orcid":false,"given":"Nariyoshi","family":"Yamai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3854-8253","authenticated-orcid":false,"given":"Sylvain","family":"Duquesne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"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\u2013331. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11693383_22"},{"key":"13_CR2","unstructured":"Bernstein, D.J., Engels, S., Lange, T., Niederhagen, R., Paar, C., Schwabe, P., Zimmermann, R.: Faster elliptic-curve discrete logarithms on FPGAs. Technical report, Cryptology eprint Archive, Report 2016\/382 (2016)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1504\/IJACT.2012.045590","volume":"2","author":"JW Bos","year":"2012","unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. IJACT 2(3), 212\u2013228 (2012). \nhttps:\/\/doi.org\/10.1504\/IJACT.2012.045590","journal-title":"IJACT"},{"key":"13_CR6","unstructured":"Certicom: the Certicom ECC challenge. \nhttps:\/\/www.certicom.com\/content\/dam\/certicom\/images\/pdfs\/challenge-2009.pdf\n\n. Accessed 10 Aug 2017"},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034981","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2005","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"issue":"232","key":"13_CR8","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1090\/S0025-5718-99-01119-9","volume":"69","author":"R Gallant","year":"2000","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Improving the parallelized pollard lambda search on anomalous binary curves. Math. Comput. Am. Math. Soc. 69(232), 1699\u20131705 (2000)","journal-title":"Math. Comput. Am. Math. Soc."},{"issue":"2","key":"13_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.15803\/ijnc.6.2_181","volume":"6","author":"S Kajitani","year":"2016","unstructured":"Kajitani, S., Nogami, Y., Miyoshi, S., Austin, T., Al-Amin, K.M., Begum, N., Duquesne, S.: Web-based volunteer computing for solving the elliptic curve discrete logarithm problem. Int. J. Netw. Comput. 6(2), 181\u2013194 (2016)","journal-title":"Int. J. Netw. Comput."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998). \nhttps:\/\/doi.org\/10.1145\/272991.272995","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"8","key":"13_CR12","first-page":"1966","volume":"9","author":"S Miyoshi","year":"2015","unstructured":"Miyoshi, S., Nogami, Y., Kusaka, T., Yamai, N.: Solving 94-bit ECDLP with 70 computers in parallel. Int. J. Comput. Electr. Autom. Control Inf. Eng. 9(8), 1966\u20131969 (2015)","journal-title":"Int. J. Comput. Electr. Autom. Control Inf. Eng."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"177","key":"13_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1587\/transfun.E92.A.182","volume":"92\u2013A","author":"Y Nogami","year":"2009","unstructured":"Nogami, Y., Sakemi, Y., Okimoto, T., Nekado, K., Akane, M., Morikawa, Y.: Scalar multiplication using frobenius expansion over twisted elliptic curve for ate pairing based cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92\u2013A(1), 182\u2013189 (2009)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"143","key":"13_CR16","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte carlo methods for index computation (mod p). Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11426639_27"},{"key":"13_CR18","unstructured":"Sakai, R., Kasahara, M.: Id based cryptosystems with pairing on elliptic curve. IACR Cryptology ePrint Archive 2003, 54 (2003)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-89641-8_16","volume-title":"Cryptology and Network Security","author":"Y Sakemi","year":"2008","unstructured":"Sakemi, Y., Nogami, Y., Okeya, K., Kato, H., Morikawa, Y.: Skew Frobenius map and efficient scalar multiplication for pairing\u2013based cryptography. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol. 5339, pp. 226\u2013239. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-89641-8_16"},{"issue":"1","key":"13_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Oorschot Van","year":"1999","unstructured":"Van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-319-13051-4_22","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"E Wenger","year":"2014","unstructured":"Wenger, E., Wolfger, P.: Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 363\u2013379. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13051-4_22"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78556-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T17:05:13Z","timestamp":1521565513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78556-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319785554","9783319785561"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78556-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}