{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:34Z","timestamp":1764996994994},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413827"},{"type":"electronic","value":"9783642413834"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41383-4_8","type":"book-chapter","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T04:37:33Z","timestamp":1384144653000},"page":"115-132","source":"Crossref","is-referenced-by-count":12,"title":["Improvement of Faug\u00e8re et al.\u2019s Method to Solve ECDLP"],"prefix":"10.1007","author":[{"given":"Yun-Ju","family":"Huang","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Petit","sequence":"additional","affiliation":[]},{"given":"Naoyuki","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"National Security Agency: The case for elliptic curve cryptography (January 2009), \n                    \n                      http:\/\/www.nsa.gov\/business\/programs\/elliptic_curve.shtml"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, A theory of factorization, and genera. In: 1969 Number Theory Institute (Proc. Sympos. Pure Math., vol. XX, State Univ. New York, Stony Brook, N.Y., 1969), Providence, R.I., pp. 415\u2013440 (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT Numerical Mathematics\u00a015(3), 331\u2013334 (1975)","journal-title":"BIT Numerical Mathematics"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R.P. Brent","year":"1980","unstructured":"Brent, R.P.: An improved Monte Carlo factorization algorithm. BIT Numerical Mathematics\u00a020, 176\u2013184 (1980)","journal-title":"BIT Numerical Mathematics"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"J.M. Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, monopoly and discrete logarithms. Journal of Cryptology\u00a013, 437\u2013447 (2000)","journal-title":"Journal of Cryptology"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/11792086_38","volume-title":"Algorithmic Number Theory","author":"C. Diem","year":"2006","unstructured":"Diem, C.: An index calculus algorithm for plane curves of small degree. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 543\u2013557. Springer, Heidelberg (2006)"},{"issue":"12","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P. Gaudry","year":"2009","unstructured":"Gaudry, P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. Journal of Symbolic Computation\u00a044(12), 1690\u20131702 (2009)","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C. Diem","year":"2011","unstructured":"Diem, C.: On the discrete logarithm problem in elliptic curves. Compositio Mathematica\u00a0147, 75\u2013104 (2011)","journal-title":"Compositio Mathematica"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-29011-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"J.-C. Faug\u00e8re","year":"2012","unstructured":"Faug\u00e8re, J.-C., Perret, L., Petit, C., Renault, G.: Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 27\u201344. Springer, Heidelberg (2012)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-34961-4_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"C. Petit","year":"2012","unstructured":"Petit, C., Quisquater, J.-J.: On polynomial systems arising from a Weil descent. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 451\u2013466. Springer, Heidelberg (2012)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Joux, A., Vitse, V.: Elliptic curve discrete logarithm problem over small degree extension fields. Journal of Cryptology, 1\u201325 (2011)","DOI":"10.1007\/s00145-011-9116-z"},{"key":"8_CR12","unstructured":"Faug\u00e8re, J.C., Gaudry, P., Huot, L., Renault, G.: Using symmetries in the index calculus for elliptic curves discrete logarithm. IACR Cryptology ePrint Archive 2012, 199 (2012)"},{"key":"8_CR13","unstructured":"Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves. IACR Cryptology ePrint Archive 2004, 31 (2004)"},{"issue":"1-3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002","author":"J.C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75\u201383. ACM, New York (2002)"},{"issue":"4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. Journal of Symbolic Computation\u00a016(4), 329\u2013344 (1993)","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-29011-4_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Joux","year":"2012","unstructured":"Joux, A., Vitse, V.: Cover and decomposition index calculus on elliptic curves made practical - application to a previously unreachable curve over \n                    \n                      \n                    \n                    $\\mathbb{F}_{p^6}$\n                  . In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 9\u201326. Springer, Heidelberg (2012)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-19074-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"A. Joux","year":"2011","unstructured":"Joux, A., Vitse, V.: A variant of the F4 algorithm. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 356\u2013375. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41383-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T01:10:47Z","timestamp":1558660247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41383-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413827","9783642413834"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41383-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}