{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T14:14:05Z","timestamp":1773238445592,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00443-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"165-180","source":"Crossref","is-referenced-by-count":8,"title":["Weil descent of Jacobians"],"prefix":"10.1016","volume":"128","author":[{"given":"Steven D","family":"Galbraith","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00443-2_BIB1","doi-asserted-by":"crossref","unstructured":"L. Adleman, J. De Marrais, M.-D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, in: L.M. Adleman, M-D. Huang (Eds.), ANTS-I, Vol. 877, Springer, Berlin, 1994, pp. 28\u201340.","DOI":"10.1007\/3-540-58691-1_39"},{"key":"10.1016\/S0166-218X(02)00443-2_BIB2","unstructured":"C. Diem, The GHS attack in odd characteristic, preprint 2001, available from http:\/\/www.exp-math.uni-essen.de\/~diem\/."},{"key":"10.1016\/S0166-218X(02)00443-2_BIB3","doi-asserted-by":"crossref","unstructured":"I. Duursma, P. Gaudry, F. Morain, Speeding up the discrete log computation on curves with automorphisms, in: Lam et al. (Eds.), ASIACRYPT \u201999, Lecture Notes in Computer Science, Vol. 1716, Springer, Berlin, 1999, pp. 103\u2013121.","DOI":"10.1007\/978-3-540-48000-6_10"},{"issue":"4","key":"10.1016\/S0166-218X(02)00443-2_BIB4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1080\/10586458.1999.10504623","article-title":"Sieving in function fields","volume":"8","author":"Flassenberg","year":"1997","journal-title":"Exp. Math."},{"key":"10.1016\/S0166-218X(02)00443-2_BIB5","unstructured":"G. Frey, How to disguise an elliptic curve, Talk at ECC \u201998, Waterloo, 1998, http:\/\/cacr.math.uwaterloo.ca\/conferences\/1998\/ecc98\/slides.html."},{"key":"10.1016\/S0166-218X(02)00443-2_BIB6","doi-asserted-by":"crossref","unstructured":"S.D. Galbraith, Limitations of constructive Weil descent, in: K. Alster, et al. (Eds.), Public-Key Cryptography and Computational Number Theory, Walter de Gruyter, Berlin, 2001, pp. 59\u201370.","DOI":"10.1515\/9783110881035.59"},{"key":"10.1016\/S0166-218X(02)00443-2_BIB7","series-title":"Codes and Cryptography Cirencester","first-page":"191","article-title":"A cryptographic application of Weil descent","volume":"Vol. 1746","author":"Galbraith","year":"1999"},{"key":"10.1016\/S0166-218X(02)00443-2_BIB8","series-title":"EUROCRYPT 2000","first-page":"19","article-title":"An algorithm for solving the discrete log problem on hyperelliptic curves","volume":"Vol. 1807","author":"Gaudry","year":"2000"},{"issue":"1","key":"10.1016\/S0166-218X(02)00443-2_BIB9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","article-title":"Constructive and destructive facets of Weil descent on elliptic curves","volume":"15","author":"Gaudry","year":"2002","journal-title":"J. Cryptology"},{"key":"10.1016\/S0166-218X(02)00443-2_BIB10","series-title":"SAC 2001","first-page":"106","article-title":"Speeding up the arithmetic on Koblitz curves of genus two","volume":"Vol. 2012","author":"G\u00fcnther","year":"2001"},{"issue":"3","key":"10.1016\/S0166-218X(02)00443-2_BIB11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02252872","article-title":"Hyperelliptic cryptosystems","volume":"1","author":"Koblitz","year":"1989","journal-title":"J. Cryptology"},{"key":"10.1016\/S0166-218X(02)00443-2_BIB12","doi-asserted-by":"crossref","unstructured":"N.P. Smart, How secure are elliptic curves over composite extension fields? in: B. Pfitzmann (Ed.), EUROCRYPT 2001, Lecture Notes in Computer Science, Vol. 2045, Springer, Berlin, 2001, pp. 30\u201339.","DOI":"10.1007\/3-540-44987-6_3"},{"key":"10.1016\/S0166-218X(02)00443-2_BIB13","unstructured":"A.-M. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen, Ph.D. Thesis, IEM Essen, 1994."},{"key":"10.1016\/S0166-218X(02)00443-2_BIB14","unstructured":"H. Stichtenoth, Algebraic Function Fields and Codes, Springer Universitext, Berlin, 1993."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T11:30:13Z","timestamp":1553686213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004432"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00443-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}